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

Showing results 41 to 60 of 228.
Sorted by year (citations)

previous 1 2 3 4 5 ... 10 11 12 next

  1. Modaresi, Sina; Kılınç, Mustafa R.; Vielma, Juan Pablo: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (2016)
  2. Newby, Eric; Ali, M.Montaz: Transformation-based preprocessing for mixed-integer quadratic programs (2016)
  3. Oates, Chris.J.; Smith, Jim Q.; Mukherjee, Sach: Estimating causal structure using conditional DAG models (2016)
  4. Oates, Chris J.; Smith, Jim Q.; Mukherjee, Sach; Cussens, James: Exact estimation of multiple directed acyclic graphs (2016)
  5. Rose, Daniel; Schmidt, Martin; Steinbach, Marc C.; Willert, Bernhard M.: Computational optimization of gas compressor stations: MINLP models versus continuous reformulations (2016)
  6. Saikko, Paul; Berg, Jeremias; Järvisalo, Matti: LMHS: A SAT-IP hybrid maxsat solver (2016)
  7. Salvagnin, Domenico: Detecting semantic groups in MIP models (2016)
  8. Schnell, Alexander; Hartl, Richard F.: On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (2016)
  9. Shinano, Yuji; Berthold, Timo; Heinz, Stefan: A first implementation of paraxpress: combining internal and external parallelization to solve MIPs on supercomputers (2016)
  10. Tran, Tony T.; Araujo, Arthur; Beck, J.Christopher: Decomposition methods for the parallel machine scheduling problem with setups (2016)
  11. Zhang, Yan; Sahinidis, Nikolaos V.: Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment (2016)
  12. Abe, Fabio Henrique N.; Hoshino, Edna A.; Hill, Alessandro: The ring tree facility location problem (2015)
  13. Berthold, Timo; Hendel, Gregor: Shift-and-propagate (2015)
  14. Björdal, Gustav; Monette, Jean-Noël; Flener, Pierre; Pearson, Justin: A constraint-based local search backend for MiniZinc (2015)
  15. Christensen, Tue R.L.; Labbé, Martine: A branch-cut-and-price algorithm for the piecewise linear transportation problem (2015)
  16. Christoph Buchheim, Marianna De Santis, Stefano Lucidi, Francesco Rinaldi, Long Trieu: A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming (2015) arXiv
  17. Costa, Lilia; Smith, Jim; Nichols, Thomas; Cussens, James; Duff, Eugene P.; Makin, Tamar R.: Searching multiregression dynamic models of resting-state fMRI networks using integer programming (2015)
  18. D’Ambrosio, Claudia; Lodi, Andrea; Wiese, Sven; Bragalli, Cristiana: Mathematical programming techniques in water network optimization (2015)
  19. Eckstein, Jonathan; Hart, William E.; Phillips, Cynthia A.: PEBBL: an object-oriented framework for scalable parallel branch and bound (2015)
  20. Firsching, Moritz: Computing maximal copies of polyhedra contained in a polyhedron (2015)

previous 1 2 3 4 5 ... 10 11 12 next

Further publications can be found at: