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

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

previous 1 2 3 ... 10 11 12 13 14 15 16 17 next

  1. Koch, Thorsten; Martin, Alexander; Pfetsch, Marc E.: Progress in Academic computational integer programming (2013)
  2. Leitner, Markus; Ruthmair, Mario; Raidl, Günther R.: Stabilizing branch-and-price for constrained tree problems (2013)
  3. Lubin, Miles; Martin, Kipp; Petra, Cosmin G.; Sandıkçı, Burhaneddin: On parallelizing dual decomposition in stochastic integer programming (2013)
  4. Misener, Ruth; Floudas, Christodoulos A.: GLOMIQO: global mixed-integer quadratic optimizer (2013)
  5. Recalde, D.; Torres, R.; Vaca, P.: Scheduling the professional Ecuadorian football league by integer programming (2013)
  6. Schutt, Andreas; Feydy, Thibaut; Stuckey, Peter J.: Explaining time-table-edge-finding propagation for the cumulative resource constraint (2013)
  7. Song, Yongjia; Luedtke, James R.: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (2013)
  8. Zhang, Peter Y.; Romero, David A.; Beck, J. Christopher; Amon, Cristina H.: Solving wind farm layout optimization with mixed integer programming and constraint programming (2013)
  9. Achterberg, Tobias; Berthold, Timo; Hendel, Gregor: Rounding and propagation heuristics for mixed integer programming (2012)
  10. Addis, Bernardetta; Carello, Giuliana; Ceselli, Alberto: Exactly solving a two-level location problem with modular node capacities (2012)
  11. Allen, Sam D.; Burke, Edmund K.; Mareček, Jakub: A space-indexed formulation of packing boxes into a larger box (2012)
  12. Armbruster, Michael; Fügenschuh, Marzena; Helmberg, Christoph; Martin, Alexander: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (2012)
  13. Avella, Pasquale; Boccia, Maurizio; Vasilyev, Igor: Computational testing of a separation procedure for the knapsack set with a single continuous variable (2012)
  14. Berthold, Timo; Gleixner, Ambros M.; Heinz, Stefan; Vigerske, Stefan: Analyzing the computational impact of MIQCP solver components (2012)
  15. Berthold, Timo; Heinz, Stefan; Vigerske, Stefan: Extending a CIP framework to solve MIQCPs (2012)
  16. Bixby, Robert E.: A brief history of linear and mixed-integer programming computation (2012)
  17. Bofill, Miquel; Palahí, Miquel; Suy, Josep; Villaret, Mateu: Solving constraint satisfaction problems with SAT modulo theories (2012)
  18. Boland, Natashia; Bley, Andreas; Fricke, Christopher; Froyland, Gary; Sotirov, Renata: Clique-based facets for the precedence constrained knapsack problem (2012)
  19. Bonami, Pierre; Kilinç, Mustafa; Linderoth, Jeff: Algorithms and software for convex mixed integer nonlinear programs (2012)
  20. Bruns, Florian; Knust, Sigrid: Optimized load planning of trains in intermodal transportation (2012)

previous 1 2 3 ... 10 11 12 13 14 15 16 17 next


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