A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem
DOI10.1016/j.disopt.2022.100741OpenAlexW3102809419MaRDI QIDQ2684046
Marije R. Siemann, Matthias Walter
Publication date: 16 February 2023
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.09135
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)
Uses Software
Cites Work
- Unnamed Item
- Complexity of the traveling tournament problem
- Heuristics for the mirrored traveling tournament problem
- Clique facets of the axial and planar assignment polytopes
- Complexity of the unconstrained traveling tournament problem
- On Latin squares and the facial structure of related polytopes
- Complexity of a 3-dimensional assignment problem
- The traveling tournament problem with predefined venues
- RobinX: a three-field classification and unified data format for round-robin sports timetabling
- Round robin scheduling -- a survey
- On multi-index assignment polytopes
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- Generating Approximate Solutions to the TTP using a Linear Distance Relaxation
- DFS* and the Traveling Tournament Problem
This page was built for publication: A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem
