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

Showing results 181 to 200 of 289.
Sorted by year (citations)

previous 1 2 3 ... 8 9 10 11 12 13 14 15 next

  1. D’ambrosio, Claudia; Lodi, Andrea: Mixed integer nonlinear programming tools: an updated practical overview (2013)
  2. De Giovanni, L.; Massi, G.; Pezzella, F.; Pfetsch, M.E.; Rinaldi, G.; Ventura, P.: A heuristic and an exact method for the gate matrix connection cost minimization problem (2013)
  3. Fischer, Anja; Helmberg, Christoph: The symmetric quadratic traveling salesman problem (2013)
  4. Gamrath, Gerald: Improving strong branching by propagation (2013)
  5. Gleixner, Ambros M.; Weltge, Stefan: Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming (2013)
  6. Gualandi, Stefano; Malucelli, Federico: Constraint programming-based column generation (2013)
  7. Heinz, Stefan; Ku, Wen-Yang; Beck, J.Christopher: Recent improvements using constraint integer programming for resource allocation and scheduling (2013)
  8. Heinz, Stefan; Schulz, Jens; Beck, J.Christopher: Using dual presolving reductions to reformulate cumulative constraints (2013)
  9. Jovanović, Dejan; De Moura, Leonardo: Cutting to the chase. (2013)
  10. Koch, Thorsten; Martin, Alexander; Pfetsch, Marc E.: Progress in Academic computational integer programming (2013)
  11. Leitner, Markus; Ruthmair, Mario; Raidl, Günther R.: Stabilizing branch-and-price for constrained tree problems (2013)
  12. Lubin, Miles; Martin, Kipp; Petra, Cosmin G.; Sandıkçı, Burhaneddin: On parallelizing dual decomposition in stochastic integer programming (2013)
  13. Misener, Ruth; Floudas, Christodoulos A.: GLOMIQO: global mixed-integer quadratic optimizer (2013)
  14. Recalde, D.; Torres, R.; Vaca, P.: Scheduling the professional Ecuadorian football league by integer programming (2013)
  15. Schutt, Andreas; Feydy, Thibaut; Stuckey, Peter J.: Explaining time-table-edge-finding propagation for the cumulative resource constraint (2013)
  16. Song, Yongjia; Luedtke, James R.: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (2013)
  17. 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)
  18. Achterberg, Tobias; Berthold, Timo; Hendel, Gregor: Rounding and propagation heuristics for mixed integer programming (2012)
  19. Addis, Bernardetta; Carello, Giuliana; Ceselli, Alberto: Exactly solving a two-level location problem with modular node capacities (2012)
  20. Allen, Sam D.; Burke, Edmund K.; Mareček, Jakub: A space-indexed formulation of packing boxes into a larger box (2012)

previous 1 2 3 ... 8 9 10 11 12 13 14 15 next

Further publications can be found at: