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 | Rundreiseproblem | Travelling salesman problem |
-
An approximation algorithm for the bipartite traveling tournament problem
Hoshino, Richard, (2013)
-
Capacitated vehicle routing with nonuniform speeds
Gørtz, Inge Li, (2016)
-
Budgeted prize-collecting traveling salesman and minimum spanning tree problems
Paul, Alice, (2020)
- More ...
-
The equivalence of semidefinite relaxations of polynomial 0-1 and +_1 programs via scaling
Cheung, Kevin K. H., (2008)
-
Revisiting a simple algorithm for the planar multiterminal cut problem
Cheung, Kevin K. H., (2010)
-
On orienting graphs for connectivity : projective planes and Halin graphs
Cheriyan, Joseph, (2012)
- More ...