A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
CLAIRE: combining sets, search and rules to better express algorithms
Proceedings of the 1999 international conference on Logic programming
Network Flow Problems in Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
INFORMS Journal on Computing
Solving a real-time allocation problem with constraint programming
Journal of Systems and Software
An Integrated Solver for Optimization Problems
Operations Research
An efficient generic network flow constraint
Proceedings of the 2011 ACM Symposium on Applied Computing
Constraint programming based column generation for employee timetabling
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Combining arc-consistency and dual lagrangean relaxation for filtering CSPs
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
INFORMS Journal on Computing
Breaking variable symmetry in almost injective problems
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
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.