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

Showing results 221 to 240 of 241.
Sorted by year (citations)

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

  1. Achterberg, Tobias; Heinz, Stefan; Koch, Thorsten: Counting solutions of integer programs using unrestricted subtree detection (2008)
  2. 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)
  3. Berthold, Timo: Heuristics of the branch-cut-and-price-framework SCIP (2008)
  4. Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.; Rudová, Hana: Penalising patterns in timetables: novel integer programming formulations (2008)
  5. Dittel, Agnes: Protein folding and self-avoiding walks. Polyhedral studies and solutions. (2008)
  6. Fügenschuh, Armin; Fügenschuh, Marzena: Integer linear programming models for topology optimization in sheet metal design (2008)
  7. Jokar, Sadegh; Pfetsch, Marc E.: Exact and approximate sparse solutions of underdetermined linear equations (2008)
  8. 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)
  9. Pfetsch, Marc E.: Branch-and-cut for the maximum feasible subsystem problem (2008)
  10. Puchinger, Jakob; Stuckey, Peter J.; Wallace, Mark; Brand, Sebastian: From high-level model to branch-and-price solution in G12 (2008)
  11. Timmreck, Dagmar: Necessary conditions for geometric realizability of simplicial complexes (2008)
  12. 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)
  13. Achterberg, Tobias: Conflict analysis in mixed integer programming (2007)
  14. Bertacco, Livio; Fischetti, Matteo; Lodi, Andrea: A feasibility pump heuristic for general mixed-integer problems (2007)
  15. Buchmann, Johannes; Dahmen, Erik; Klintsevich, Elena; Okeya, Katsuyuki; Vuillaume, Camille: Merkle signatures with virtually unlimited signature capacity (2007)
  16. C^oté, Marie-Claude; Gendron, Bernard; Rousseau, Louis-Martin: Modeling the regular constraint with integer programming (2007)
  17. Althaus, Ernst; Caprara, Alberto; Lenhof, Hans-Peter; Reinert, Knut: A branch-and-cut algorithm for multiple sequence alignment (2006)
  18. Armbruster, Michael; Fügenschuh, Marzena; Helmberg, Christoph; Jetchev, Nikolay; Martin, Alexander: LP-based genetic algorithm for the minimum graph bisection problem (2006)
  19. Linderoth, Jeffrey T.; Ralphs, Ted K.: Noncommercial software for mixed-integer linear programming (2006)
  20. Milano, Michela; Wallace, Mark: Integrating operations research in constraint programming (2006)

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


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