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

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

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

  1. Rendl, Franz; Rinaldi, Giovanni; Wiegele, Angelika: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (2010)
  2. Stuckey, Peter J.; Becket, Ralph; Fischer, Julien: Philosophy of the MiniZinc challenge (2010)
  3. Wallace, Chris: ZI round, a MIP rounding heuristic (2010)
  4. Wojtaszek, Daniel T.; Chinneck, John W.: Faster MIP solutions via new node selection rules (2010)
  5. Achterberg, Tobias: SCIP: solving constraint integer programs (2009)
  6. Berthold, Timo; Heinz, Stefan; Pfetsch, Marc E.: Nonlinear pseudo-Boolean optimization: Relaxation or propagation? (2009) ioport
  7. Berthold, Timo; Pfetsch, Marc E.: Detecting orbitopal symmetries (2009)
  8. Bérubé, Jean-François; Gendreau, Michel; Potvin, Jean-Yves: A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (2009)
  9. Fischetti, Matteo; Salvagnin, Domenico: Feasibility pump 2.0 (2009)
  10. Gualandi, Stefano; Malucelli, Federico: Constraint programming-based column generation (2009)
  11. Heinz, Stefan; Sachenbacher, Martin: Using model counting to find optimal distinguishing tests (2009)
  12. Karzan, Fatma Kılınç; Nemhauser, George L.; Savelsbergh, Martin W.P.: Information-based branching schemes for binary linear mixed integer problems (2009)
  13. Koster, Arie M.C.A.; Zymolka, Adrian; Kutschka, Manuel: Algorithms to separate $\0,\frac12$-Chv\'atal-Gomory cuts$ (2009)
  14. Mouret, Sylvain; Grossmann, Ignacio E.; Pestiaux, Pierre: Tightening the linear relaxation of a mixed integer nonlinear program using constraint programming (2009)
  15. Stetsyuk, P.I.; Lykhovyd, A.P.: LP-oriented upper bounds for the weighted stability number of a graph (2009)
  16. Achterberg, Tobias; Berthold, Timo; Koch, Thorsten; Wolter, Kati: Constraint integer programming: A new approach to integrate CP and MIP (2008)
  17. Achterberg, Tobias; Heinz, Stefan; Koch, Thorsten: Counting solutions of integer programs using unrestricted subtree detection (2008)
  18. 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)
  19. Berthold, Timo: Heuristics of the branch-cut-and-price-framework SCIP (2008)
  20. Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.; Rudová, Hana: Penalising patterns in timetables: novel integer programming formulations (2008)

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


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