Modelling mixed-integer optimisation problems in constraint logic programming
Peter Barth, Alexander Bockmayr · MPG.PuRe (Max Planck Society) · 1995
Constraint logic programming (CLP) has become a promising new technology for solving complex combinatorial problems.In this paper, we investigate how (constraint) logic programming can support the modelling part in solving mixed-integer optimisation problems.First we show that the basic functionality of algebraic modelling languages can be realised very easily in a pure logic programming system like Prolog and that, even without using constraints, various additional features are available.Then we focus on the constraint solving facilities oered by CLP systems.In particular, we explain how the constraint solver of the constraint logic programming language CLP(PB) can be used in modelling 0-1 problems.