A unifying framework for integer and finite domain constraint programming

Bockmayr, Alexander; Kasper, Thomas

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

報告書

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

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

MPI-I-97-2-008.pdf
(全文テキスト（全般）), 328KB

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-9A23-4

要旨

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.