A Benders approach for the constrained minimum break problem
From MaRDI portal
(Redirected from Publication:856212)
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
Cites work
- A constrained sports scheduling problem
- A polynomial-time algorithm to find an equitable home--away assignment
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- Combinatorial aspects of construction of competition Dutch professional football leagues
- Constructing timetables for sport competitions
- Global constraints for round robin tournament scheduling.
- scientific article; zbMATH DE number 1728542 (Why is no real title available?)
- scientific article; zbMATH DE number 2084735 (Why is no real title available?)
- Logic-based Benders decomposition
- Matching theory
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- Minimization of the number of breaks in sports scheduling problems using constraint programming
- Minimizing breaks by maximizing cuts.
- Principles and Practice of Constraint Programming – CP 2004
- Scheduling a Major College Basketball Conference—Revisited
- Scheduling in Sports
- Scheduling sport tournaments using constraint logic programming
- Scheduling the Italian football league: an ILP-based approach
- Semidefinite programming based approaches to the break minimization problem
- Some models of graphs for scheduling sports competitions
Cited in
(32)- A branching scheme for finding cost-minimal round robin tournaments
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- Minimizing costs in round robin tournaments with place constraints
- Minimizing breaks by maximizing cuts.
- Constraint programming and operations research
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
- Scheduling double round-robin tournaments with divisional play using constraint programming
- 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
- A beam search approach to the traveling tournament problem
- Optimizing rest times and differences in games played: an iterative two-phase approach
- RobinX: a three-field classification and unified data format for round-robin sports timetabling
- Single-facility scheduling by logic-based Benders decomposition
- Scheduling a triple round robin tournament for the best Danish soccer league
- Round robin scheduling -- a survey
- Semidefinite programming based approaches to the break minimization problem
- A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
- On the generalized mirrored scheme for double round robin tournaments in sports scheduling
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- Logic-based Benders decomposition for large-scale optimization
- A combinatorial Benders' decomposition for the lock scheduling problem
- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
- A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
- Sports scheduling: problems and applications
- 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
- An improved approximation algorithm for the traveling tournament problem
- Tournament design: a review from an operational research perspective
- The timetable constrained distance minimization problem
- Solving mirrored traveling tournament problem benchmark instances with eight teams
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)
