Solving Constraint Integer Programs 1.1.0

Solving Constraint Integer Programs is a framework for constraint integer programming.

  Add it to your Download Basket!

 Add it to your Watch List!

0/5

Rate it!

What's new in Solving Constraint Integer Programs 1.1.0:

  • New constraint handlers for SOS constraints.
  • Better support for compilation of projects using SCIP.
  • SCIP can now count integer solutions.
  • A column generation example for graph coloring has been added.
Read full changelog
send us
an update
LICENSE TYPE:
Other/Proprietary License
USER RATING:
2.9/5 17
DEVELOPED BY:
Tobias Achterberg
HOMEPAGE:
scip.zib.de
CATEGORY:
ROOT \ Science and Engineering \ Artificial Intelligence
Solving Constraint Integer Programs is a framework for constraint integer programming. For solving Integer Programs and Constraint Programs, a very similar technique is used: the problem is successively divided into smaller subproblems (branching) that are solved recursively.

On the other hand, Integer Programming and Constraint Programming have different strengths: Integer Programming uses LP relaxations and cutting planes to provide strong dual bounds, while Constraint Programming can handle arbitrary (non-linear) constraints and uses propagation to tighten the variable's domains.

SCIP is a framework for Constraint Integer Programming oriented towards the needs of Mathematical Programming experts who want to have total control of the solution process and access detailed information down to the guts of the solver. SCIP can also be used as pure MIP solver or as framework for branch-cut-and-price.

Last updated on October 2nd, 2008

feature list

#integer programming #constant integer #programming framework #SCIP #constant #integer #programming

Add your review! 1 USER REVIEW SO FAR

SUBMIT