Althaus, Ernst, Bockmayr, Alexander, Elf, Matthias, Kasper, Thomas, Jünger, Michael and Mehlhorn, Kurt (2002). SCIL - Symbolic Constraints in Integer Linear Programming. In: Algorithms - ESA 2002 : 10th annual European symposium, Rome, Italy, September 17 - 21, 2002 ; proceedings, pp. 75-87. Springer.

[thumbnail of zaik2002-437.pdf]
Preview
 PDF
zaik2002-437.pdf - Submitted Version
Download (273kB) | Preview

Abstract

We describe SCIL. SCIL 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 programs.

Item Type: Book Section
Creators:
Creators
Email
ORCID
ORCID Put Code
Althaus, Ernst
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Bockmayr, Alexander
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Elf, Matthias
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Kasper, Thomas
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Jünger, Michael
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Mehlhorn, Kurt
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
URN: urn:nbn:de:hbz:38-548664
Title of Book: Algorithms - ESA 2002 : 10th annual European symposium, Rome, Italy, September 17 - 21, 2002 ; proceedings
Series Name: Lecture notes in computer science
Volume: 2461
Page Range: pp. 75-87
Date: 2002
Publisher: Springer
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54866

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item