DFS* and the Traveling Tournament Problem

DOI10.1007/978-3-642-01929-6_21zbMath1241.90123OpenAlexW1569558302MaRDI QIDQ3630167

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

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

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

Related Items (6)

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 ⋮ A complete search method for the relaxed traveling tournament problem ⋮ A beam search approach to the traveling tournament problem

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