SCIP

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 263 articles , 4 standard articles )

Showing results 181 to 200 of 263.
Sorted by year (citations)

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

  1. Boland, Natashia; Bley, Andreas; Fricke, Christopher; Froyland, Gary; Sotirov, Renata: Clique-based facets for the precedence constrained knapsack problem (2012)
  2. Bonami, Pierre; Kilinç, Mustafa; Linderoth, Jeff: Algorithms and software for convex mixed integer nonlinear programs (2012)
  3. Bruns, Florian; Knust, Sigrid: Optimized load planning of trains in intermodal transportation (2012)
  4. Dorndorf, Ulrich; Droste, Stefan; Koch, Thorsten: Using Zimpl for modeling production planning problems (2012)
  5. Fischetti, Matteo; Monaci, Michele: Cutting plane versus compact formulations for uncertain (integer) linear programs (2012)
  6. Fischetti, Matteo; Monaci, Michele: Branching on nonchimerical fractionalities (2012)
  7. Gleixner, Ambros M.; Held, Harald; Huang, Wei; Vigerske, Stefan: Towards globally optimal operation of water supply networks (2012)
  8. Kjeldsen, Niels Hvidberg; Chiarandini, Marco: Heuristic solutions to the long-term unit commitment problem with cogeneration plants (2012)
  9. Koch, Thorsten; Ralphs, Ted; Shinano, Yuji: Could we use a million cores to solve an integer program? (2012)
  10. Lach, Gerald; Lübbecke, Marco E.: Curriculum based course timetabling: new solutions to Udine benchmark instances (2012)
  11. Lübbecke, Marco; Puchert, Christian: Primal heuristics for branch-and-price algorithms (2012)
  12. Magos, D.; Mourtos, I.; Appa, G.: A polyhedral approach to the \italldifferent system (2012)
  13. Oren, Yossef; Renauld, Mathieu; Standaert, François-Xavier; Wool, Avishai: Algebraic side-channel attacks beyond the Hamming weight leakage model (2012)
  14. Yamamura, Kiyotaka; Tamura, Naoya: Finding all solutions of separable systems of piecewise-linear equations using integer programming (2012)
  15. Achterberg, Tobias (ed.); Beck, J. Christopher (ed.): Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23--27, 2011. Proceedings (2011)
  16. Büsing, Christina; Koster, Arie M.C.A.; Kutschka, Manuel: Recoverable robust knapsacks: the discrete scenario case (2011)
  17. Caprara, Alberto; Oswald, Marcus; Reinelt, Gerhard; Schwarz, Robert; Traversi, Emiliano: Optimal linear arrangements using betweenness variables (2011)
  18. Chwatal, Andreas M.; Raidl, Günther R.: Solving the minimum label spanning tree problem by mathematical programming techniques (2011)
  19. Cook, William; Koch, Thorsten; Steffy, Daniel E.; Wolter, Kati: An exact rational mixed-integer programming solver (2011)
  20. D’Ambrosio, Claudia; Lodi, Andrea: Mixed integer nonlinear programming tools: a practical overview (2011)

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


Further publications can be found at: http://scip.zib.de/#work