Welcome to the project pages of Simple and Fast Implementation of Exact
Optimization Algorithms with SCIL. This project is part of the
DFG Priority Programme Algorithm Engineering (SPP 1307).
SCIL
The SCIL (Symbolic Constraints in Integer
Linear-Programming) software package facilitates and accelerates the
implementation of exact solution algorithms for hard optimization
problems. It has been applied successfully in many different areas.
SCIL is based on an efficient branch-and-cut algorithm. However, in
contrast to other software, it allows to specify symbolic
constraints instead of linear constraints. Symbolic constraints
play an important role in Constraint Programming and make SCIL a
user-friendly tool, allowing even non-experts to easily access powerful
state-of-the-art optimization techniques.
→ to download SCIL, follow the Software link.
Objectives
The overall objective of our project is to extend and improve the
performance of SCIL significantly. The two main improvements will
concern the implementation of new symbolic constraints and numerically
exact solution methods. Among others, we will introduce symbolic
constraints modeling nonlinearity both in the objective
functions and in the side constraints. This will drastically extend
the range of problems to which SCIL can be applied directly. The
implementation of a numerically exact solver is not only
desirable in general, but can be crucial in safety-critical
applications, such as automatic verification of hybrid systems.
→ for more details, follow the Project link.
Contact
For questions and comments, send an email to info@scil-opt.net.
Last Update
Tue Feb 23 23:00:08 CET 2010