English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

SCIL - Symbolic Constraints in Integer Linear Programming.

MPS-Authors
/persons/resource/persons44003

Althaus,  Ernst
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44149

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

/persons/resource/persons44376

Elf,  Matthias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44739

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

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45250

Raman,  Rajeev
Algorithms and Complexity, 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)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Althaus, E., Bockmayr, A., Elf, M., Kasper, T., Jünger, M., & Mehlhorn, K. (2002). SCIL - Symbolic Constraints in Integer Linear Programming. In Algorithms - ESA 2002: 10th Annual European Symposium (pp. 75-87). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3067-E
Abstract
We describe a new software system SCIL that introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs. Symbolic constraints are known from constraint programming and contribute significantly to the expressive power, ease of use, and efficiency of constraint programming systems.