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

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

1 2 3 ... 20 21 22 next

  1. Aleksander Figiel, Anne-Sophie Himmel, Andre Nichterlein, Rolf Niedermeier: On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (2020) arXiv
  2. Alimo, Ryan; Beyhaghi, Pooriya; Bewley, Thomas R.: Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (2020)
  3. Basso, S.; Ceselli, Alberto; Tettamanzi, Andrea: Random sampling and machine learning to understand good decompositions (2020)
  4. Bogdanov, I. P.; Sudakov, V. A.; Toporov, N. B.: Loading optimization of an ordered set of aircrafts (2020)
  5. Bulhões, Teobaldo; Sadykov, Ruslan; Subramanian, Anand; Uchoa, Eduardo: On the exact solution of a large class of parallel machine scheduling problems (2020)
  6. Coey, Chris; Lubin, Miles; Vielma, Juan Pablo: Outer approximation with conic certificates for mixed-integer convex problems (2020)
  7. Del Pia, Alberto; Khajavirad, Aida; Sahinidis, Nikolaos V.: On the impact of running intersection inequalities for globally solving polynomial optimization problems (2020)
  8. Enayati, Shakiba; Özaltın, Osman Y.: Optimal influenza vaccine distribution with equity (2020)
  9. Fischer, Tobias; Pfetsch, Marc E.: On the structure of linear programs with overlapping cardinality constraints (2020)
  10. Fischetti, Matteo; Monaci, Michele: A branch-and-cut algorithm for mixed-integer bilinear programming (2020)
  11. Garvie, Marcus; Burkardt, John: A new mathematical model for tiling finite regions of the plane with polyominoes (2020)
  12. Gleixner, Ambros; Maher, Stephen J.; Müller, Benjamin; Pedroso, João Pedro: Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (2020)
  13. Grimstad, Bjarne; Knudsen, Brage R.: Mathematical programming formulations for piecewise polynomial functions (2020)
  14. Hojny, Christopher: Packing, partitioning, and covering symresacks (2020)
  15. Izunaga, Yoichi; Matsui, Tomomi; Yamamoto, Yoshitsugu: A doubly nonnegative relaxation for modularity density maximization (2020)
  16. Kazachkov, Aleksandr M.; Nadarajah, Selvaprabu; Balas, Egon; Margot, François: Partial hyperplane activation for generalized intersection cuts (2020)
  17. Kobayashi, Ken; Takano, Yuich: A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (2020)
  18. Müller, Benjamin; Serrano, Felipe; Gleixner, Ambros: Using two-dimensional projections for stronger separation and propagation of bilinear terms (2020)
  19. Muts, Pavlo; Nowak, Ivo; Hendrix, Eligius M. T.: The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (2020)
  20. Pedroso, João Pedro: Heuristics for packing semifluids (2020)

1 2 3 ... 20 21 22 next

Further publications can be found at: