*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
TITLE: Solving Constraint Integer Programs
SPEAKER: Timo Berthold
ABSTRACT:
Constraint integer programming (CIP) is a novel way to combine constraint programming (CP) and mixed integer programming (MIP) methodologies. It is a generalization of MIP that supports the notion of general constraints as in CP. We introduce the software SCIP which is a solver and framework for constraint integer programming that also features SAT solving techniques.
We describe the various types of plugins which turn the basic CIP framework into a fully-fledged MIP solver and explain their role in the solving process. A special focus is put on branching rules, which are in the core of any branch-and-bound algorithm. We present hybrid branching, which combines variable selection rules from CP, MIP and SAT and outperforms state-of-the-art branching rules for MIPs on common MIP benchmark sets.
