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

Showing results 41 to 60 of 340.
Sorted by year (citations)

previous 1 2 3 4 5 ... 15 16 17 next

  1. Mertens, Nick; Kunde, Christian; Kienle, Achim; Michaels, Dennis: Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (2018)
  2. Montanher, Tiago; Neumaier, Arnold; Domes, Ferenc: A computational study of global optimization solvers on two trust region subproblems (2018)
  3. Nohra, Carlos J.; Sahinidis, Nikolaos V.: Global optimization of nonconvex problems with convex-transformable intermediates (2018)
  4. Pajor, Thomas; Uchoa, Eduardo; Werneck, Renato F.: A robust and scalable algorithm for the Steiner problem in graphs (2018)
  5. Schweiger, Jonas: Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty (2018)
  6. Schweiger, Jonas; Liers, Frauke: A decomposition approach for optimal gas network extension with a finite set of demand scenarios (2018)
  7. Shinano, Yuji: The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound (2018)
  8. Shinano, Yuji; Berthold, Timo; Heinz, Stefan: ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers (2018)
  9. Speakman, Emily; Lee, Jon: On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (2018)
  10. Thammawichai, Mason; Kerrigan, Eric C.: Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors (2018)
  11. Torres, Jean; Silva, Emerson; Hoshino, Edna A.: Heuristic approaches to the distinguishing substring selection problem (2018)
  12. Vigerske, Stefan; Gleixner, Ambros: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (2018)
  13. Wang, Akang; Hanselman, Christopher L.; Gounaris, Chrysanthos E.: A customized branch-and-bound approach for irregular shape nesting (2018)
  14. Witzig, Jakob; Beckenbach, Isabel; Eifler, Leon; Fackeldey, Konstantin; Gleixner, Ambros; Grever, Andreas; Weber, Marcus: Mixed-integer programming for cycle detection in nonreversible Markov processes (2018)
  15. Zhou, Kai; Kılınç, Mustafa R.; Chen, Xi; Sahinidis, Nikolaos V.: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (2018)
  16. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  17. Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with polymake (2017)
  18. Bartlett, Mark; Cussens, James: Integer linear programming for the Bayesian network structure learning problem (2017)
  19. Beck, Amir; Pan, Dror: A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (2017)
  20. Belotti, Pietro; Berthold, Timo: Three ideas for a feasibility pump for nonconvex MINLP (2017)

previous 1 2 3 4 5 ... 15 16 17 next

Further publications can be found at: