A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem
From MaRDI portal
Publication:6354011
DOI10.1016/j.disopt.2022.100741zbMath1509.90077arXiv2011.09135MaRDI QIDQ6354011
Matthias Walter, Marije R. Siemann
Publication date: 18 November 2020
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
This page was built for publication: A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem