DFS* and the Traveling Tournament Problem

DOI10.1007/978-3-642-01929-6_21MaRDI QIDQ3630167zbMATH OpenOpenAlexFDO

Authors David C. Uthus, Patricia J. Riddle, Hans Werner Guesgen

Publication date 3 June 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-01929-6_21

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A new branch-and-price algorithm for the traveling tournament problem
• A note on symmetry reduction for circular traveling tournament problems
• A combined local search and integer programming approach to the traveling tournament problem
• A beam search approach to the traveling tournament problem
• A variable neighborhood search method for solving the traveling tournaments problem

Cited in

(6)

• A beam search approach to the traveling tournament problem
• A complete search method for the relaxed traveling tournament problem
• A new branch-and-price algorithm for the traveling tournament problem
• A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem
• A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
• A note on symmetry reduction for circular traveling tournament problems

This page was built for publication: DFS* and the Traveling Tournament Problem

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