ZIB Projects Using SCIP

• Symmetries in Integer Programming, DFG Research Center Matheon,  Project B12.
• Chip Design Verification, DFG Research Center Matheon,  Project D17.
• VeriCount - Counting Solutions in the Field of Verification
• Service Design in Public Transport, DFG Research Center Matheon,  Project B15.
• Infeasible Linear Inequality Systems.
• Discrete Morse Functions.
• Integrated Planning of Multi-layer Networks, DFG Research Center Matheon,  Project B3.

Examples Of ZIB-External Projects 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
• Improving the Feasibility Pump. Tobias Achterberg, Timo Berthold
  Discrete Optimization, Special Issue 4, 2007
• Teaching MIP Modeling and Solving. Tobias Achterberg, Thorsten Koch, and Martin Grötschel
  ORMS Today 33, no. 6
  
• 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
  
• Auslegung heterogener Kommunikationsnetze nach Performance und Wirtschaftlichkeit. Andreas Bley, Friederich Kupzog, and Adrian Zymolka
  Proc. of the 12th 11th Kasseler Symposium Energie-Systemtechnik: Energie und Kommunikation, 2006
  
• 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
  
• 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
  ZIB Report 05-46, 2005
  

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