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

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

previous 1 2 3 ... 9 10 11 12 next

  1. Gualandi, Stefano; Malucelli, Federico: Constraint programming-based column generation (2009)
  2. Heinz, Stefan; Sachenbacher, Martin: Using model counting to find optimal distinguishing tests (2009)
  3. Karzan, Fatma Kılınç; Nemhauser, George L.; Savelsbergh, Martin W.P.: Information-based branching schemes for binary linear mixed integer problems (2009)
  4. Koster, Arie M.C.A.; Zymolka, Adrian; Kutschka, Manuel: Algorithms to separate $\0,\frac12$-Chv\'atal-Gomory cuts$ (2009)
  5. Mouret, Sylvain; Grossmann, Ignacio E.; Pestiaux, Pierre: Tightening the linear relaxation of a mixed integer nonlinear program using constraint programming (2009)
  6. Stetsyuk, P.I.; Lykhovyd, A.P.: LP-oriented upper bounds for the weighted stability number of a graph (2009)
  7. Achterberg, Tobias; Berthold, Timo; Koch, Thorsten; Wolter, Kati: Constraint integer programming: A new approach to integrate CP and MIP (2008)
  8. Achterberg, Tobias; Heinz, Stefan; Koch, Thorsten: Counting solutions of integer programs using unrestricted subtree detection (2008)
  9. Armbruster, Michael; Fügenschuh, Marzena; Helmberg, Christoph; Martin, Alexander: A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem (2008)
  10. Berthold, Timo: Heuristics of the branch-cut-and-price-framework SCIP (2008)
  11. Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.; Rudová, Hana: Penalising patterns in timetables: novel integer programming formulations (2008)
  12. Dittel, Agnes: Protein folding and self-avoiding walks. Polyhedral studies and solutions. (2008)
  13. Fügenschuh, Armin; Fügenschuh, Marzena: Integer linear programming models for topology optimization in sheet metal design (2008)
  14. Jokar, Sadegh; Pfetsch, Marc E.: Exact and approximate sparse solutions of underdetermined linear equations (2008)
  15. Kalcsics, Jörg (ed.); Nickel, Stefan (ed.): Operations Research Proceedings 2007. Selected papers of the annual international conference of the German Operations Research Society (GOR), Saarbrücken, Germany, September 5--7, 2007. (2008)
  16. Pfetsch, Marc E.: Branch-and-cut for the maximum feasible subsystem problem (2008)
  17. Puchinger, Jakob; Stuckey, Peter J.; Wallace, Mark; Brand, Sebastian: From high-level model to branch-and-price solution in G12 (2008)
  18. Timmreck, Dagmar: Necessary conditions for geometric realizability of simplicial complexes (2008)
  19. Torres, Luis M.; Torres, Ramiro; Borndörfer, Ralf; Pfetsch, Marc E.: Line planning on paths and tree networks with applications to the Quito trolebús system (2008)
  20. Achterberg, Tobias: Conflict analysis in mixed integer programming (2007)

previous 1 2 3 ... 9 10 11 12 next

Further publications can be found at: