90 search results - page 1 / 18 » Combinatorial Benders' Cuts |
IOR
2006
13 years 5 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
IPCO
2004
13 years 6 months ago
2004
CCE
2010
13 years 2 months ago
2010
EOR
2010
13 years 5 months ago
2010
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At ...
EOR
2007
13 years 5 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...