A Benders approach for the constrained minimum break problem
Authors:
- Rasmus V. RasmussenRRRasmus V. Rasmussen
- Michael A. TrickMTMichael A. Trick
- 1 February 2007
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 177 (1) , 198-213
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Scheduling the Italian Football League: an ILP-based approachComputers & Operations Research, 2006
- Semidefinite programming based approaches to the break minimization problemComputers & Operations Research, 2006
- A polynomial-time algorithm to find an equitable home–away assignmentOperations Research Letters, 2005
- Global constraints for round robin tournament schedulingEuropean Journal of Operational Research, 2004
- Minimizing breaks by maximizing cutsOperations Research Letters, 2003
- Logic-based Benders decompositionMathematical Programming, 2003
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization ProblemsINFORMS Journal on Computing, 2001
- Scheduling a Major College Basketball Conference—RevisitedOperations Research, 2001
- A constrained sports scheduling problemDiscrete Applied Mathematics, 1990
- Some models of graphs for scheduling sports competitionsDiscrete Applied Mathematics, 1988