ZIB Projects Using SCIP

• Optimization of Gas Transport, DFG Research Center Matheon,  Project B20.
• Chip Design Verification, DFG Research Center Matheon,  Project D17.
• Discrete Morse Functions.
• Exact Integer Programming, DFG Priority Program 1307 Algorithm Engineering.
• Infeasible Linear Inequality Systems.
• Integrated Planning of Multi-layer Networks, DFG Research Center Matheon,  Project B3.
• MLTN - Multi-layer Transport Networks
• Service Design in Public Transport, DFG Research Center Matheon,  Project B15.
• Stable sets and special graph classes
• Symmetries in Integer Programming, DFG Research Center Matheon,  Project B12.
• VeriCount - Counting Solutions in the Field of Verification

Examples Of Projects Outside ZIB Using SCIP

• SCIL - Symbolic Constraints in Integer Linear programming, Max-Planck-Institut für Informatik
• Scheduling the SBB Cargo Railroad routing and shipment operations at night, Combinatorial Optimization & Graph Algorithms Group, TU Berlin.

Some Papers That Use SCIP

• Conflict Analysis in Mixed Integer Programming
  Tobias Achterberg
  Discrete Optimization, Special Issue 4, 2007
• Hybrid Branching
  Tobias Achterberg, Timo Berthold
  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2009, LNCS 5547, 05.2009.
  
• Improving the Feasibility Pump
  Tobias Achterberg, Timo Berthold
  Discrete Optimization, Special Issue 4, 2007
• Constraint Integer Programming: Techniques and Applications
  Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Kati Wolter
  ZIB-Report 08-43.
  
• Constraint Integer Programming: a New Approach to Integrate CP and MIP
  Tobias Achterberg, Timo Berthold, Thorsten Koch, Kati Wolter
  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2008, LNCS 5015, 2008
• Teaching MIP Modeling and Solving
  Tobias Achterberg, Thorsten Koch, and Martin Grötschel
  ORMS Today 33, no. 6
  
• Counting solutions of integer programs using unrestricted subtree detection
  Tobias Achterberg, Stefan Heinz, Thorsten Koch
  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2008, LNCS 5015, 2008
• Experiments with Linear and Semidefinite Relaxations for Solving the Minimum Graph Bisection Problem
  Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, and Alexander Martin
  Technical Report, TU Darmstadt, 2006
  
• Heuristics of the Branch-Cut-and-Price-Framework SCIP
  Timo Berthold
  Operations Research Proceedings 2007
  
• RENS - Relaxation Enforced Neighborhood Search
  Timo Berthold
  ZIB-Report 07-28
  
• Nonlinear pseudo-Boolean optimization: relaxation or propagation?
  Timo Berthold, Stefan Heinz, Marc E. Pfetsch
  Theory and Applications of Satisfiability Testing – SAT 2009, LNCS 5584, 2009
  
• Solving Pseudo-Boolean Problems with SCIP
  Timo Berthold, Stefan Heinz, Marc E. Pfetsch
  ZIB-Report 08-12
  
• Extending a CIP framework to solve MIQCPs
  Timo Berthold, Stefan Heinz, Stefan Vigerske
  ZIB-Report 09-23
  
• Auslegung heterogener Kommunikationsnetze nach Performance und Wirtschaftlichkeit
  Andreas Bley, Friederich Kupzog, and Adrian Zymolka
  Proc. of the 11th Kasseler Symposium Energie-Systemtechnik: Energie und Kommunikation, 2006
  
• Angebotsplanung im öffentlichen Nahverkehr
  Ralf Borndörfer, Marika Neumann, Marc E. Pfetsch
  ZIB-Report 08-04, to appear in Heureka'08
  
• Integer linear programming models for topology optimization in sheet metal design
  Armin Fügenschuh and Marzena Fügenschuh
  Mathematical Methods of Operations Research, to appear (2008)
  
• Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
  Sadegh Jokar, Marc E. Pfetsch
  ZIB-Report 07-05
  
• Computing Optimal Morse Matchings
  Michael Joswig and Marc E. Pfetsch
  SIAM Journal on Discrete Mathematics 20, no. 1, 2006
  
• Orbitopal Fixing
  Volker Kaibel, Matthias Peinhardt, and Marc E. Pfetsch
  Proc. of the 12th Integer Programming and Combinatorial Optimization conference (IPCO)
  M. Fischetti and D. Williamson (eds.), LNCS 4513, Springer-Verlag, 74-88, 2007
  
• Rapid Mathematical Programming or How to Solve Sudoku Puzzles in a few Seconds
  Thorsten Koch
  Operations Research Proceedings 2005
  
• Algorithms to separate {0,1/2}-Chvatal-Gomory cuts
  Arie M. C. A. Koster, Adrian Zymolka and Manuel Kutschka
  Algorithmica, online first (2008) [preprint: ZIB-Report 07-10]
  
• Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics
  Sebastian Orlowski, Arie M. C. A. Koster, Christian Raack, and Roland Wessäly
  Proceedings of the Third International Network Optimization Conference, 2007
  
• Branch-And-Cut for the Maximum Feasible Subsystem Problem
  Marc E. Pfetsch
  SIAM Journal on Optimization 19, No.1, 21-38 (2008)
  

If you know about further projects or papers that use SCIP, please let us know.