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

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

1 2 3 ... 24 25 26 next

  1. Allman, Andrew; Zhang, Qi: Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (2021)
  2. Anderson, Daniel; Le Bodic, Pierre; Morgan, Kerri: Further results on an abstract model for branching and its application to mixed integer programming (2021)
  3. Antoine Prouvost, Justin Dumouchelle, Maxime Gasse, Didier Chételat, Andrea Lodi: Ecole: A Library for Learning Inside MILP Solvers (2021) arXiv
  4. Barkalov, K. A.; Gergel, V. P.; Lebedev, I. G.: Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems (2021)
  5. Bendotti, Pascale; Fouilhoux, Pierre; Rottner, Cécile: Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem (2021)
  6. Berthold, Timo; Csizmadia, Zsolt: The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers (2021)
  7. Berthold, Timo; Witzig, Jakob: Conflict analysis for MINLP (2021)
  8. Bestehorn, Felix; Hansknecht, Christoph; Kirches, Christian; Manns, Paul: Mixed-integer optimal control problems with switching costs: a shortest path approach (2021)
  9. Blanco, V.; Japón, A.; Ponce, D.; Puerto, J.: On the multisource hyperplanes location problem to fitting set of points (2021)
  10. Casazza, Marco; Ceselli, Alberto: Optimization algorithms for resilient path selection in networks (2021)
  11. Casazza, Marco; Ceselli, Alberto; Wolfler Calvo, Roberto: A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (2021)
  12. Çelik, Türkü Özlüm; Jamneshan, Asgar; Montúfar, Guido; Sturmfels, Bernd; Venturello, Lorenzo: Wasserstein distance to independence models (2021)
  13. Ceselli, Alberto; Felipe, Ángel; Ortuño, M. Teresa; Righini, Giovanni; Tirado, Gregorio: A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies (2021)
  14. Chen, Liang; Chen, Wei-Kun; Yang, Mu-Ming; Dai, Yu-Hong: An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (2021)
  15. Coniglio, Stefano; Sirvent, Mathias; Weibelzahl, Martin: Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets (2021)
  16. Dias, Gustavo; Liberti, Leo: Exploiting symmetries in mathematical programming via orbital independence (2021)
  17. Elloumi, Sourour; Lambert, Amélie; Lazare, Arnaud: Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (2021)
  18. Flórez-Gutiérrez, Antonio; Leurent, Gaëtan; Naya-Plasencia, María; Perrin, Léo; Schrottenloher, André; Sibleyras, Ferdinand: Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsfGimli (2021)
  19. Hojny, Christopher; Joormann, Imke; Lüthen, Hendrik; Schmidt, Martin: Mixed-integer programming techniques for the connected max-(k)-cut problem (2021)
  20. Kobayashi, Ken; Takano, Yuichi; Nakata, Kazuhide: Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization (2021)

1 2 3 ... 24 25 26 next

Further publications can be found at: