A new branch-and-price algorithm for the traveling tournament problem

DOI10.1016/J.EJOR.2009.10.024MaRDI QIDQ2655609zbMATH OpenOpenAlexFDO

Authors Stefan Irnich

Publication date 25 January 2010

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2009.10.024

zbMATH Keywords

branch-and-pricecolumn generationsports league schedulingtimetablingtraveling tournament problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A note on symmetry reduction for circular traveling tournament problems
• Approximation algorithms for \(\mathrm{TTP(2)}\)
• Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem
• Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm
• Generating approximate solutions to the TTP using a linear distance relaxation

Cites work

• A Benders approach for computing lower bounds for the mirrored traveling tournament problem
• A branching scheme for finding cost-minimal round robin tournaments
• Branching rules revisited
• DFS* and the Traveling Tournament Problem
• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• scientific article; zbMATH DE number 1452994 (Why is no real title available?)
• scientific article; zbMATH DE number 2230230 (Why is no real title available?)
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Resource extension functions: properties, inversion, and generalization to segments
• Round robin scheduling -- a survey
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Solving mirrored traveling tournament problem benchmark instances with eight teams
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Cited in

(10)

• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
• Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling
• Competitive strategies for an online generalized assignment problem with a service consecution constraint
• A combined local search and integer programming approach to the traveling tournament problem
• DFS* and the Traveling Tournament Problem
• A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
• Sports scheduling: problems and applications
• A note on symmetry reduction for circular traveling tournament problems
• Tournament design: a review from an operational research perspective
• Sport scheduling to minimize travels at the FIFA world cup 2026

This page was built for publication: A new branch-and-price algorithm for the traveling tournament problem

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