SCIL - Symbolic Constraints in Integer Linear Programming

Authors:
Ernst Althaus;Alexander Bockmayr;Matthias Elf;Michael Jünger;Thomas Kasper;Kurt Mehlhorn
Affiliations:
-;-;-;-;-;-
Venue:
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Year:
2002

Citing 14
Cited 2

Integer and combinatorial optimization

Integer and combinatorial optimization
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Solving binary cutting stock problems by column generation and branch-and-bound

Computational Optimization and Applications
The precedence-constrained asymmetric traveling salesman polytope

Mathematical Programming: Series A and B
Strategic directions in constraint programming

ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Constraints in OZ

ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
A combinatorial approach to protein docking with flexible side-chains

RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software—Practice & Experience - Special issue on discrete algorithm engineering
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Computational Optimization and Applications
Traveling Salesman-Based Curve Reconstruction in Polynomial Time

SIAM Journal on Computing
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming

INFORMS Journal on Computing

Constraint integer programming: a new approach to integrate CP and MIP

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Improved filtering for weighted circuit constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

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.