A 2.75-approximation algorithm for the unconstrained traveling tournament problem
Year of publication: |
2014
|
---|---|
Authors: | Imahori, Shinji ; Matsui, Tomomi ; Miyashiro, Ryuhei |
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. 237-247
|
Subject: | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Extensives Spiel | Extensive form game |
-
Unconstrained traveling tournament problem is APX-complete
Bendayan, Salomon, (2023)
-
A complete search method for the relaxed traveling tournament problem
Brandão, Filipe, (2014)
-
Complexity of the unconstrained traveling tournament problem
Bhattacharyya, Rishiraj, (2016)
- More ...
-
An approximation algorithm for the traveling tournament problem
Miyashiro, Ryuhei, (2012)
-
An approximation algorithm for the traveling tournament problem
Miyashiro, Ryuhei, (2012)
-
A polynomial-time algorithm to find an equitable home-away assignment
Miyashiro, Ryuhei, (2005)
- More ...