MPI-INF/SWS Research Reports 1991-2017

2. Number - only D2


A unifying framework for integer and finite domain constraint programming

Bockmayr, Alexander and Kasper, Thomas

August 1997, 24 pages.

Status: available - back from printing

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

  • Attachement: ATTE3Q2H (324 KBytes)

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},