English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

A unifying framework for integer and finite domain constraint programming

MPS-Authors
/persons/resource/persons44149

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

/persons/resource/persons44739

Kasper,  Thomas
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPI-I-97-2-008.pdf
(Any fulltext), 328KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Bockmayr, A., & Kasper, T.(1997). A unifying framework for integer and finite domain constraint programming (MPI-I-1997-2-008). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-9A23-4
Abstract
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.