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

Showing results 1 to 20 of 223.
Sorted by year (citations)

1 2 3 ... 10 11 12 next

  1. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  2. Brinkmann, Philip; Ziegler, Günter M.: A flag vector of a 3-sphere that is not the flag vector of a 4-polytope (2017)
  3. Cussens, James; Järvisalo, Matti; Korhonen, Janne H.; Bartlett, Mark: Bayesian network structure learning with integer programming: polytopes, facets and complexity (2017)
  4. Gleixner, Ambros M.; Berthold, Timo; Müller, Benjamin; Weltge, Stefan: Three enhancements for optimization-based bound tightening (2017)
  5. Göttlich, Simone; Potschka, Andreas; Ziegler, Ute: Partial outer convexification for traffic light optimization in road networks (2017)
  6. Haws, David; Cussens, James; Studený, Milan: Polyhedral approaches to learning Bayesian networks (2017)
  7. Humpola, Jesco; Serrano, Felipe: Sufficient pruning conditions for MINLP in gas network design (2017)
  8. Ichim, Bogdan; Katthän, Lukas; Moyano-Fernández, Julio José: How to compute the Stanley depth of a module (2017)
  9. Khan, Kamil A.; Watson, Harry A.J.; Barton, Paul I.: Differentiable McCormick relaxations (2017)
  10. Lima, Ricardo M.; Grossmann, Ignacio E.: On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (2017)
  11. Puranik, Yash; Sahinidis, Nikolaos V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (2017)
  12. Andreatta, G.; Casula, M.; De Francesco, C.; De Giovanni, L.: A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows (2016)
  13. Berthold, Timo; Farmer, James; Heinz, Stefan; Perregaard, Michael: Parallelization of the FICO Xpress-Optimizer (2016)
  14. Boland, Natashia; Kalinowski, Thomas; Rigterink, Fabian: New multi-commodity flow formulations for the pooling problem (2016)
  15. Borndörfer, Ralf; Schenker, Sebastian; Skutella, Martin; Strunk, Timo: PolySCIP (2016)
  16. Borraz-Sánchez, Conrado; Bent, Russell; Backhaus, Scott; Hijazi, Hassan; Van Hentenryck, Pascal: Convex relaxations for gas expansion planning (2016)
  17. Boukouvala, Fani; Misener, Ruth; Floudas, Christodoulos A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (2016)
  18. Braun, Gábor; Pokutta, Sebastian: A polyhedral characterization of border bases (2016)
  19. Bruns, Winfried; Sieg, Richard; Söger, Christof: The subdivision of large simplicial cones in normaliz (2016)
  20. Buchheim, Christoph; De Santis, Marianna; Lucidi, Stefano; Rinaldi, Francesco; Trieu, Long: A feasible active set method with reoptimization for convex quadratic mixed-integer programming (2016)

1 2 3 ... 10 11 12 next

Further publications can be found at: