Complexity of the unconstrained traveling tournament problem

DOI10.1016/J.ORL.2016.07.011MaRDI QIDQ1755839zbMATH OpenOpenAlexFDO

Authors 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

NP-hardschedulingtraveling tournament problem

Mathematics Subject Classification ID

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

Recommendations

• Complexity of the traveling tournament problem
• On the complexity of the traveling umpire problem
• A 2.75-approximation algorithm for the unconstrained traveling tournament problem
• An improved approximation algorithm for the traveling tournament problem
• An Improved Approximation Algorithm for the Traveling Tournament Problem

Cites work

• A 2.75-approximation algorithm for the unconstrained traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• An ILS heuristic for the traveling tournament problem with predefined venues
• Complexity of the traveling tournament problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• Round robin scheduling -- a survey
• Scheduling in sports: an annotated bibliography

Cited in

(12)

• Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem
• An approximation algorithm for the traveling tournament problem
• A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem
• A further improvement on approximating TTP-2
• Unconstrained traveling tournament problem is APX-complete
• Complexity of the traveling tournament problem
• The APX-hardness of the traveling tournament problem
• The traveling tournament problem: improved algorithms based on cycle packing
• A matching-based approximation algorithm for the traveling tournament problem
• On the initial transition of graphs of Kirkman schedules by the partial team swap
• A 5-approximation algorithm for the traveling tournament problem
• Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755839)