A Benders approach for the constrained minimum break problem
From MaRDI portal
Publication:856212
DOI10.1016/J.EJOR.2005.10.063zbMATH Open1102.90026OpenAlexW2044566891MaRDI QIDQ856212FDOQ856212
Authors: Rasmus V. Rasmussen, Michael A. Trick 
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
Recommendations
- Minimizing costs in round robin tournaments with place constraints
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- A branch-and-price algorithm for scheduling sport leagues
- Semidefinite programming based approaches to the break minimization problem
sports schedulingtimetablinghybrid integer programming/constraint programminglogic based Benders cuts
Cites Work
- Matching theory
- Logic-based Benders decomposition
- Scheduling in Sports
- Title not available (Why is that?)
- Combinatorial aspects of construction of competition Dutch professional football leagues
- Global constraints for round robin tournament scheduling.
- Some models of graphs for scheduling sports competitions
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- Scheduling the Italian football league: an ILP-based approach
- Title not available (Why is that?)
- Minimizing breaks by maximizing cuts.
- A polynomial-time algorithm to find an equitable home--away assignment
- Semidefinite programming based approaches to the break minimization problem
- Principles and Practice of Constraint Programming – CP 2004
- A constrained sports scheduling problem
- Scheduling sport tournaments using constraint logic programming
- Minimization of the number of breaks in sports scheduling problems using constraint programming
- Scheduling a Major College Basketball Conference—Revisited
- Constructing timetables for sport competitions
Cited In (31)
- Round robin scheduling -- a survey
- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
- RobinX: a three-field classification and unified data format for round-robin sports timetabling
- Logic-Based Benders Decomposition for Large-Scale Optimization
- Sports scheduling: Problems and applications
- A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
- Constraint programming and operations research
- A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
- The timetable constrained distance minimization problem
- Solving mirrored traveling tournament problem benchmark instances with eight teams
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- Minimizing breaks by maximizing cuts.
- Single-facility scheduling by logic-based Benders decomposition
- A Lagrangian approach for minimum cost single round robin tournaments
- On the separation in 2-period double round robin tournaments with minimum breaks
- A branching scheme for finding cost-minimal round robin tournaments
- Scheduling a triple round robin tournament for the best Danish soccer league
- An approximation algorithm for the traveling tournament problem
- Semidefinite programming based approaches to the break minimization problem
- Optimizing rest times and differences in games played: an iterative two-phase approach
- A combinatorial Benders' decomposition for the lock scheduling problem
- Minimizing costs in round robin tournaments with place constraints
- A beam search approach to the traveling tournament problem
- An improved approximation algorithm for the traveling tournament problem
- Confection de calendriers de matchs pour le sport universitaire et collégial au Québec
- On the generalized mirrored scheme for double round robin tournaments in sports scheduling
- First-break-heuristically-schedule: constructing highly-constrained sports timetables
- A traditional Benders' approach to sports timetabling
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
- Scheduling double round-robin tournaments with divisional play using constraint programming
- Benders' cuts guided large neighborhood search for the traveling umpire problem
This page was built for publication: A Benders approach for the constrained minimum break problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856212)
