@article{f29775738722432e9d639c5310ccb13d,
title = "A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem",
abstract = "We consider the unconstrained traveling tournament problem, a sports timetabling problem that minimizes traveling of teams. Since its introduction about 20 years ago, most research was devoted to modeling and reformulation approaches. In this paper we carry out a polyhedral study for the cubic integer programming formulation by establishing the dimension of the integer hull as well as of faces induced by model inequalities. Moreover, we introduce a new class of inequalities and show that they are facet-defining. Finally, we evaluate the impact of these inequalities on the linear programming bounds.",
author = "Siemann, {Marije R.} and Matthias Walter",
year = "2022",
month = nov,
doi = "10.1016/j.disopt.2022.100741",
language = "English",
volume = "46",
journal = "Discrete optimization",
issn = "1572-5286",
publisher = "Elsevier B.V.",
}