Generating Approximate Solutions to the TTP Using a Linear Distance Relaxation
Abstract
In some domestic professional sports leagues, the home stadiums are located in cities connected by a common train line running in one direction. For these instances, we can incorporate this geographical information to determine optimal or nearly-optimal solutions to the We introduce the Linear Distance Traveling Tournament Problem (LD-TTP), and solve it for We conclude the paper by applying this linear distance relaxation to general (non-linear)
Cite
Text
Hoshino and Kawarabayashi. "Generating Approximate Solutions to the TTP Using a Linear Distance Relaxation." Journal of Artificial Intelligence Research, 2012. doi:10.1613/JAIR.3713Markdown
[Hoshino and Kawarabayashi. "Generating Approximate Solutions to the TTP Using a Linear Distance Relaxation." Journal of Artificial Intelligence Research, 2012.](https://mlanthology.org/jair/2012/hoshino2012jair-generating/) doi:10.1613/JAIR.3713BibTeX
@article{hoshino2012jair-generating,
title = {{Generating Approximate Solutions to the TTP Using a Linear Distance Relaxation}},
author = {Hoshino, Richard and Kawarabayashi, Ken-ichi},
journal = {Journal of Artificial Intelligence Research},
year = {2012},
pages = {257-286},
doi = {10.1613/JAIR.3713},
volume = {45},
url = {https://mlanthology.org/jair/2012/hoshino2012jair-generating/}
}