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

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

1 2 3 ... 26 27 28 next

  1. Anderson, Lovis; Turner, Mark; Koch, Thorsten: Generative deep learning for decision making in gas networks (2022)
  2. Andrade, Tiago; Belyak, Nikita; Eberhard, Andrew; Hamacher, Silvio; Oliveira, Fabricio: The (p)-Lagrangian relaxation for separable nonconvex MIQCQP problems (2022)
  3. Berger, Mathias; Radu, David; Dubois, Antoine; Pandžić, Hrvoje; Dvorkin, Yury; Louveaux, Quentin; Ernst, Damien: Siting renewable power generation assets with combinatorial optimisation (2022)
  4. Catanzaro, Daniele; Coniglio, Stefano; Furini, Fabio: On the exact separation of cover inequalities of maximum-depth (2022)
  5. Chen, Qi; Johnson, Emma S.; Bernal, David E.; Valentin, Romeo; Kale, Sunjeev; Bates, Johnny; Siirola, John D.; Grossmann, Ignacio E.: Pyomo.GDP: an ecosystem for logic based modeling and optimization development (2022)
  6. de Souza, Marcelo; Ritt, Marcus; López-Ibáñez, Manuel: Capping methods for the automatic configuration of optimization algorithms (2022)
  7. Gade, Jan-Lucas; Thore, Carl-Johan; Stålhand, Jonas: Identification of mechanical properties of arteries with certification of global optimality (2022)
  8. Gusmeroli, Nicolò; Wiegele, Angelika: \textttEXPEDIS: an exact penalty method over discrete sets (2022)
  9. Hendel, Gregor: Adaptive large neighborhood search for mixed integer programming (2022)
  10. Hendel, Gregor; Anderson, Daniel; Le Bodic, Pierre; Pfetsch, Marc E.: Estimating the size of branch-and-bound trees (2022)
  11. He, Taotao; Tawarmalani, Mohit: Tractable relaxations of composite functions (2022)
  12. Lam, Edward; Desaulniers, Guy; Stuckey, Peter J.: Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (2022)
  13. Lam, Edward; Le Bodic, Pierre; Harabor, Daniel; Stuckey, Peter J.: Branch-and-cut-and-price for multi-agent path finding (2022)
  14. Lee, In Gyu; Yoon, Sang Won; Won, Daehan: A mixed integer linear programming support vector machine for cost-effective group feature selection: branch-cut-and-price approach (2022)
  15. Lenz, Ralf; Serrano, Felipe: Tight convex relaxations for the expansion planning problem (2022)
  16. Liberti, Leo; Manca, Benedetto: Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (2022)
  17. Lundell, Andreas; Kronqvist, Jan: Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (2022)
  18. Lundell, Andreas; Kronqvist, Jan; Westerlund, Tapio: The supporting hyperplane optimization toolkit for convex MINLP (2022)
  19. Müller, Benjamin; Muñoz, Gonzalo; Gasse, Maxime; Gleixner, Ambros; Lodi, Andrea; Serrano, Felipe: On generalized surrogate duality in mixed-integer nonlinear programming (2022)
  20. Niu, Yi-Shuai; Glowinski, Roland: Discrete dynamical system approaches for Boolean polynomial optimization (2022)

1 2 3 ... 26 27 28 next

Further publications can be found at: