Cut generation for an employee timetabling problem
Motivated by an industrial application, we study a specific employee timetabling problem. Several investigations are being conducted: a lower bound by Lagrangian relaxation, a heuristic based on a cut generation process and an exact method by Benders decomposition. Experimental results on real and generated instances are reported.
Year of publication: |
2009
|
---|---|
Authors: | Detienne, Boris ; Pridy, Laurent ; Pinson, ric ; Rivreau, David |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 197.2009, 3, p. 1178-1184
|
Publisher: |
Elsevier |
Keywords: | Employee timetabling problem Multi-choice multi-dimensional knapsack problem Benders decomposition |
Saved in:
Saved in favorites
Similar items by person
-
Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
Detienne, Boris, (2010)
-
Exploiting special structure in semidefinite programming: A survey of theory and applications
Detienne, Boris, (2010)
-
Cut generation for an employee timetabling problem
Detienne, Boris, (2009)
- More ...