Unconstrained traveling tournament problem is APX-complete
Year of publication: |
2023
|
---|---|
Authors: | Bendayan, Salomon ; Cheriyan, Joseph ; Cheung, Kevin K. H. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 51.2023, 4, p. 456-460
|
Subject: | Approximation algorithms | APX-complete | Traveling salesman problem | Traveling tournament problem | Tourenplanung | Vehicle routing problem | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Rundreiseproblem | Travelling salesman problem | Algorithmus | Algorithm | Extensives Spiel | Extensive form game |
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
Scheduling on a graph with release times
Wei, Yu, (2023)
-
He, Xuan, (2023)
- More ...
-
Revisiting a simple algorithm for the planar multiterminal cut problem
Cheung, Kevin K. H., (2010)
-
The equivalence of semidefinite relaxations of polynomial 0-1 and +_1 programs via scaling
Cheung, Kevin K. H., (2008)
-
On orienting graphs for connectivity: Projective planes and Halin graphs
Cheriyan, Joseph, (2012)
- More ...