A 5.875-approximation for the Traveling Tournament Problem
Year of publication: |
2014
|
---|---|
Authors: | Westphal, Stephan ; Noparlik, Karl |
Published in: |
The practice and theory of automated timetabling : [this special volume comprises revised versions of a selection of the papers that were presented at the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT) in Belfast between 10th and 13th August 2010]. - New York, NY : Springer. - 2014, p. 347-360
|
Subject: | Tourenplanung | Vehicle routing problem | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Sportveranstaltung | Sport event | Extensives Spiel | Extensive form game |
-
Solving the traveling tournament problem with iterative-deepening A
Uthus, David C., (2012)
-
A 2.75-approximation algorithm for the unconstrained traveling tournament problem
Imahori, Shinji, (2014)
-
A complete search method for the relaxed traveling tournament problem
Brandão, Filipe, (2014)
- More ...
-
Tiedemann, Morten, (2015)
-
Approximation algorithms for a vehicle routing problem
Krumke, Sven O., (2008)
-
A monotone approximation algorithm for scheduling with precedence constraints
Krumke, Sven O., (2008)
- More ...