SCIP is currently one of the fastest non-commercial solvers for mixed integer programming (MIP) and mixed integer nonlinear programming (MINLP). It is also a framework for constraint integer programming and branch-cut-and-price. It allows for total control of the solution process and the access of detailed information down to the guts of the solver. SCIP is part of the SCIP Optimization Suite, which also contains the LP solver SoPlex, the modelling language ZIMPL, the parallelization framework UG and the generic column generation solver GCG.

This software is also peer reviewed by journal MPC.

References in zbMATH (referenced in 289 articles , 4 standard articles )

Showing results 201 to 220 of 289.
Sorted by year (citations)

previous 1 2 3 ... 9 10 11 12 13 14 15 next

  1. Armbruster, Michael; Fügenschuh, Marzena; Helmberg, Christoph; Martin, Alexander: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (2012)
  2. Avella, Pasquale; Boccia, Maurizio; Vasilyev, Igor: Computational testing of a separation procedure for the knapsack set with a single continuous variable (2012)
  3. Berthold, Timo; Gleixner, Ambros M.; Heinz, Stefan; Vigerske, Stefan: Analyzing the computational impact of MIQCP solver components (2012)
  4. Berthold, Timo; Heinz, Stefan; Vigerske, Stefan: Extending a CIP framework to solve MIQCPs (2012)
  5. Bixby, Robert E.: A brief history of linear and mixed-integer programming computation (2012)
  6. Bofill, Miquel; Palahí, Miquel; Suy, Josep; Villaret, Mateu: Solving constraint satisfaction problems with SAT modulo theories (2012)
  7. Boland, Natashia; Bley, Andreas; Fricke, Christopher; Froyland, Gary; Sotirov, Renata: Clique-based facets for the precedence constrained knapsack problem (2012)
  8. Bonami, Pierre; Kilinç, Mustafa; Linderoth, Jeff: Algorithms and software for convex mixed integer nonlinear programs (2012)
  9. Bruns, Florian; Knust, Sigrid: Optimized load planning of trains in intermodal transportation (2012)
  10. Dorndorf, Ulrich; Droste, Stefan; Koch, Thorsten: Using Zimpl for modeling production planning problems (2012)
  11. Fischetti, Matteo; Monaci, Michele: Cutting plane versus compact formulations for uncertain (integer) linear programs (2012)
  12. Fischetti, Matteo; Monaci, Michele: Branching on nonchimerical fractionalities (2012)
  13. Gleixner, Ambros M.; Held, Harald; Huang, Wei; Vigerske, Stefan: Towards globally optimal operation of water supply networks (2012)
  14. Kjeldsen, Niels Hvidberg; Chiarandini, Marco: Heuristic solutions to the long-term unit commitment problem with cogeneration plants (2012)
  15. Koch, Thorsten; Ralphs, Ted; Shinano, Yuji: Could we use a million cores to solve an integer program? (2012)
  16. Lach, Gerald; Lübbecke, Marco E.: Curriculum based course timetabling: new solutions to Udine benchmark instances (2012)
  17. Lübbecke, Marco; Puchert, Christian: Primal heuristics for branch-and-price algorithms (2012)
  18. Magos, D.; Mourtos, I.; Appa, G.: A polyhedral approach to the \italldifferent system (2012)
  19. Oren, Yossef; Renauld, Mathieu; Standaert, François-Xavier; Wool, Avishai: Algebraic side-channel attacks beyond the Hamming weight leakage model (2012)
  20. Yamamura, Kiyotaka; Tamura, Naoya: Finding all solutions of separable systems of piecewise-linear equations using integer programming (2012)

previous 1 2 3 ... 9 10 11 12 13 14 15 next

Further publications can be found at: