Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


A unifying framework for integer and finite domain constraint programming

Bockmayr, Alexander and Kasper, Thomas

MPI-I-97-2-008. August 1997, 24 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
We present a unifying framework for integer linear programming and finite domain constraint programming, which is based on a distinction of primitive and non-primitive constraints and a general notion of branch-and-infer. We compare the two approaches with respect to their modeling and solving capabilities. We introduce symbolic constraint abstractions into integer programming. Finally, we discuss possible combinations of the two approaches.
Categories / Keywords: constraint logic programming, integer programming, combinatorial optimization, modeling
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-97-2-008.ps324 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Bockmayr, Alexander and Kasper, Thomas},
  TITLE = {A unifying framework for integer and finite domain constraint programming},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-97-2-008},
  MONTH = {August},
  YEAR = {1997},
  ISSN = {0946-011X},