SCIL - Symbolic Constraints in Integer Linear Programming

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

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.


Actions:
Download: [img] Postscript - Preprinted Version
Download (495kB) | Preview
Download: [img] PDF - Preprinted Version
Download (273kB) | Preview
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Proceedings article
Citations: 1 (Web of Science)
Uncontrolled Keywords: combinatorial optimization integer programming branch-and-cut-and-price symbolic constarints
Subjects:
  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C11 Mixed integer programming

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C27 Combinatorial optimization

    		•
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
    Related URLs:
    Deposit Information:
    ZAIK Number: zaik2002-437
    Depositing User: Matthias Elf
    Date Deposited: 03 Apr 2003 00:00
    Last Modified: 06 Oct 2014 15:28
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/437