de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Modelling Discrete Optimisation Problems in Constraint Logic Programming

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44073

Barth,  Peter
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44149

Bockmayr,  Alexander
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Barth, P., & Bockmayr, A. (1998). Modelling Discrete Optimisation Problems in Constraint Logic Programming. Annals of Operations Research, 81, 467-496.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-385A-E
Abstract
Constraint logic programming 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 when solving discrete 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 offered by constraint logic programming 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.