Further SCIP Information

Papers dealing with SCIP

• Constraint Integer Programming Tobias Achterberg
  Ph.D. thesis, TU Berlin, July 2007, bibtex

  The log files for SCIP 0.90f and SCIP 0.90i of the benchmarks conducted in the Ph.D. thesis are available here.
  The log files for CPLEX 10.0.1 can be found here.

• SCIP: Solving Constraint Integer Programs Tobias Achterberg
  Mathematical Programming Computation Nr. 1(1), pp. 1–41, 2009

• Primal Heuristics for Mixed Integer Programs Timo Berthold
  Diploma Thesis, TU Berlin, September 2006, bibtex

• Implementation of Cutting Plane Separators for Mixed Integer Programs Kati Wolter
  Diploma Thesis, TU Berlin, December 2006, bibtex

• SCIP - a framework to integrate Constraint and Mixed Integer Programming Tobias Achterberg
  Technical Report ZR-04-19, ZIB, June 2004, bibtex

Talks about SCIP

The following talks were given at the SCIP Workshop 2007 (description in German) and may be a good starting point for learning about SCIP.

• SCIP Introduction [pdf]
• SCIP Primal Heuristics [pdf]
• SCIP Branching [PowerPoint]
• SCIP Conflict Analysis [PowerPoint]
• SCIP Cutting Planes [pdf]

SCIP Exercises

The following exercises were given at the SCIP Workshop 2007 (description in German) and may be a good way of learning to program with SCIP.

• Exercise: TSP Heuristic [pdf]
• Exercise: Linear Ordering Constraint Handler [pdf]

The solutions are given in the following files.

• HeurFrats.h
• HeurFrats.cpp

• cons_linearordering.h
• cons_linearordering.c

SCIP Introduction

Cornelius Schwarz kindly provided a SCIP Introduction. It demonstrates the first steps of using SCIP as a branch-and-cut framework. The n-queens problem serves as an example.

• SCIP Introduction [pdf]
• Corresponding Code

More information and a version of the code with different makefiles can be found on these pages, authored by Cornelius Schwarz. It also features an explanation of how to use SCIP with Visual Studio.