A Benders approach for the constrained minimum break problem

DOI10.1016/j.ejor.2005.10.063zbMath1102.90026OpenAlexW2044566891MaRDI QIDQ856212

Michael A. Trick, Rasmus V. Rasmussen

Publication date: 7 December 2006

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

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

zbMATH Keywords

timetablingsports schedulinghybrid integer programming/constraint programminglogic based Benders cuts

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

Constraint programming and operations research, Benders' cuts guided large neighborhood search for the traveling umpire problem, The timetable constrained distance minimization problem, A combinatorial Benders' decomposition for the lock scheduling problem, Optimizing rest times and differences in games played: an iterative two-phase approach, A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems, Confection de calendriers de matchs pour le sport universitaire et collégial au Québec, First-break-heuristically-schedule: constructing highly-constrained sports timetables, A traditional Benders' approach to sports timetabling, A multi-round generalization of the traveling tournament problem and its application to Japanese baseball, Single-facility scheduling by logic-based Benders decomposition, An improved approximation algorithm for the traveling tournament problem, Solving mirrored traveling tournament problem benchmark instances with eight teams, Logic-Based Benders Decomposition for Large-Scale Optimization, Scheduling a triple round robin tournament for the best Danish soccer league, Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling, Scheduling double round-robin tournaments with divisional play using constraint programming, Round robin scheduling -- a survey, Sports scheduling: Problems and applications, An approximation algorithm for the traveling tournament problem, A Lagrangian approach for minimum cost single round robin tournaments, On the separation in 2-period double round robin tournaments with minimum breaks, RobinX: a three-field classification and unified data format for round-robin sports timetabling, A branching scheme for finding cost-minimal round robin tournaments, A Benders approach for computing lower bounds for the mirrored traveling tournament problem, A beam search approach to the traveling tournament problem, Minimizing costs in round robin tournaments with place constraints, ON THE GENERALIZED MIRRORED SCHEME FOR DOUBLE ROUND ROBIN TOURNAMENTS IN SPORTS SCHEDULING

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A constrained sports scheduling problem
• Matching theory
• Some models of graphs for scheduling sports competitions
• Combinatorial aspects of construction of competition Dutch professional football leagues
• Scheduling sport tournaments using constraint logic programming
• Logic-based Benders decomposition
• Minimizing breaks by maximizing cuts.
• Global constraints for round robin tournament scheduling.
• A polynomial-time algorithm to find an equitable home--away assignment
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• Scheduling the Italian football league: an ILP-based approach
• Semidefinite programming based approaches to the break minimization problem
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Scheduling a Major College Basketball Conference—Revisited
• Constructing timetables for sport competitions
• Scheduling in Sports
• Principles and Practice of Constraint Programming – CP 2004