Sciweavers

Share
CP
2000
Springer

Linear Formulation of Constraint Programming Models and Hybrid Solvers

10 years 4 days ago
Linear Formulation of Constraint Programming Models and Hybrid Solvers
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization problems. We propose a way to provide a linear formulation of such a model and detail, in particular, the transformation of some global constraints. An automatic procedure for producing and updating formulations has been implemented and we illustrate it on combinatorial optimization problems.
Philippe Refalo
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2000
Where CP
Authors Philippe Refalo
Comments (0)
books