Complexity of the unconstrained traveling tournament problem

DOI10.1016/j.orl.2016.07.011zbMath1408.90122OpenAlexW2482644989MaRDI QIDQ1755839

Rishiraj Bhattacharyya

Publication date: 11 January 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.07.011

zbMATH Keywords

schedulingNP-hardtraveling tournament problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (5)

Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ Unconstrained traveling tournament problem is APX-complete ⋮ A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem ⋮ A further improvement on approximating TTP-2 ⋮ Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem

Cites Work

• A 2.75-approximation algorithm for the unconstrained traveling tournament problem
• Complexity of the traveling tournament problem
• Scheduling in sports: an annotated bibliography
• A simulated annealing approach to the traveling tournament problem
• An ILS heuristic for the traveling tournament problem with predefined venues
• Round robin scheduling -- a survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of the unconstrained traveling tournament problem