An approximation algorithm for the bipartite traveling tournament problem
Year of publication: |
2013
|
---|---|
Authors: | Hoshino, Richard ; Kawarabayashi, Ken-ichi |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 38.2013, 4, p. 720-728
|
Subject: | scheduling | approximation algorithms | traveling tournament problem | traveling salesman | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Theorie | Theory |
-
Unconstrained traveling tournament problem is APX-complete
Bendayan, Salomon, (2023)
-
O(log m)-approximation for the routing open shop problem
Kononov, Alexander, (2015)
-
Complexity of the unconstrained traveling tournament problem
Bhattacharyya, Rishiraj, (2016)
- More ...
-
Hoshino, Richard, (2011)
-
Hoshino, Richard, (2011)
-
Hoshino, Richard, (2011)
- More ...