Solving Constraint Integer Programs

Event Details
  • Date/Time:
    • Wednesday June 3, 2009 - Thursday June 4, 2009
      2:00 pm - 2:59 pm
  • Location: Executive Classroom
  • Phone:
  • URL:
  • Email:
  • Fee(s):
  • Extras:
Anita Race
H. Milton Stewart School of Industrial and Systems Engineering
Contact Anita Race

Summary Sentence: Solving Constraint Integer Programs

Full Summary: Solving Constraint Integer Programs

TITLE: Solving Constraint Integer Programs

SPEAKER: Timo Berthold


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.

Additional Information

In Campus Calendar

School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
  • Created By: Anita Race
  • Workflow Status: Published
  • Created On: Oct 12, 2009 - 4:35pm
  • Last Updated: Oct 7, 2016 - 9:47pm