zbMATH — the first resource for mathematics

Linear formulation of constraint programming models and hybrid solvers. (English) Zbl 1044.68792
Dechter, Rina (ed.), Principles and practice of constraint programming - CP 2000. 6th international conference, Singapore, September 18–21, 2000. Proceedings. Berlin: Springer (ISBN 3-540-41053-8). Lect. Notes Comput. Sci. 1894, 369-383 (2000).
Summary: 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.
For the entire collection see [Zbl 0947.00041].

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90C27 Combinatorial optimization
Full Text: Link