ISSN:
1572-9338
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract Constraint logic programming has become a promising new technology for solving complexcombinatorial problems. In this paper, we investigate how (constraint) logic programmingcan support the modelling part when solving discrete optimisation problems. First, we showthat the basic functionality of algebraic modelling languages can be realised very easily ina pure logic programming system like PROLOG and that, even without using constraints,various additional features are available. Then we focus on the constraint-solving facilitiesoffered by constraint logic programming systems. In particular, we explain how the constraintsolver of the constraint logic programming language CLP(PB) can be used in modelling0 - 1 problems.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1018981813157
Permalink
