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

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

1 2 3 ... 23 24 25 next

  1. Antoine Prouvost, Justin Dumouchelle, Maxime Gasse, Didier Chételat, Andrea Lodi: Ecole: A Library for Learning Inside MILP Solvers (2021) arXiv
  2. Barkalov, K. A.; Gergel, V. P.; Lebedev, I. G.: Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems (2021)
  3. Bendotti, Pascale; Fouilhoux, Pierre; Rottner, Cécile: Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem (2021)
  4. Berthold, Timo; Csizmadia, Zsolt: The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers (2021)
  5. Berthold, Timo; Witzig, Jakob: Conflict analysis for MINLP (2021)
  6. Bestehorn, Felix; Hansknecht, Christoph; Kirches, Christian; Manns, Paul: Mixed-integer optimal control problems with switching costs: a shortest path approach (2021)
  7. Blanco, V.; Japón, A.; Ponce, D.; Puerto, J.: On the multisource hyperplanes location problem to fitting set of points (2021)
  8. Casazza, Marco; Ceselli, Alberto: Optimization algorithms for resilient path selection in networks (2021)
  9. Casazza, Marco; Ceselli, Alberto; Wolfler Calvo, Roberto: A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (2021)
  10. Çelik, Türkü Özlüm; Jamneshan, Asgar; Montúfar, Guido; Sturmfels, Bernd; Venturello, Lorenzo: Wasserstein distance to independence models (2021)
  11. 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)
  12. Dias, Gustavo; Liberti, Leo: Exploiting symmetries in mathematical programming via orbital independence (2021)
  13. Elloumi, Sourour; Lambert, Amélie; Lazare, Arnaud: Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (2021)
  14. Liers, Frauke; Martin, Alexander; Merkert, Maximilian; Mertens, Nick; Michaels, Dennis: Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (2021)
  15. Lübbecke, Marco E.; Maher, Stephen J.; Witt, Jonas T.: Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (2021)
  16. Maher, Stephen J.: Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework (2021)
  17. Mezőfi, Dávid; Nagy, Gábor P.: New Steiner 2-designs from old ones by paramodifications (2021)
  18. Najman, Jaromił; Bongartz, Dominik; Mitsos, Alexander: Linearization of McCormick relaxations and hybridization with the auxiliary variable method (2021)
  19. Okuno, Takayuki; Ikebe, Yoshiko: A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques (2021)
  20. Rössig, Ansgar; Petkovic, Milena: Advances in verification of ReLU neural networks (2021)

1 2 3 ... 23 24 25 next

Further publications can be found at: