DMCA
Constraint programming contribution to benders decomposition: a case study (2002)
Cached
Download Links
- [e-lab.bouygues.com]
- [e-lab.bouygues.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In CP-02 |
| Citations: | 20 - 3 self |
BibTeX
@INPROCEEDINGS{Benoist02constraintprogramming,
author = {Thierry Benoist and Etienne Gaudin and Benoît Rottembourg},
title = {Constraint programming contribution to benders decomposition: a case study},
booktitle = {In CP-02},
year = {2002},
pages = {603--617}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. The aim of this paper is to demonstrate that CP could be a better candidate than MIP for solving the master problem within a Benders decomposition approach. Our demonstration is based on a case study of a workforce scheduling problem encountered in a large call center of Bouygues Telecom, a French mobile phone operator. Our experiments show that CP can advantageously replace MIP for the implementation of the master problem due to its greater ability to efficiently manage a wide variety of constraints such as the ones occurring in time tabling applications. 1.
