Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Refalo, P. (2000). Linear formulation of constraint programming models and hybrid solvers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1894, pp. 369–383). Springer Verlag. https://doi.org/10.1007/3-540-45349-0_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
