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

Showing results 21 to 40 of 254.
Sorted by year (citations)

previous 1 2 3 4 ... 11 12 13 next

  1. Lima, Ricardo M.; Grossmann, Ignacio E.: On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (2017)
  2. Modaresi, Sina; Vielma, Juan Pablo: Convex hull of two quadratic or a conic quadratic and a quadratic inequality (2017)
  3. Newby, Eric; Ali, M.M.: Linear transformation based solution methods for non-convex mixed integer quadratic programs (2017)
  4. Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Uchoa, Eduardo: Improved branch-cut-and-price for capacitated vehicle routing (2017)
  5. Pferschy, Ulrich; Staněk, Rostislav: Generating subtour elimination constraints for the TSP from pure integer solutions (2017)
  6. Puranik, Yash; Sahinidis, Nikolaos V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (2017)
  7. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  8. Witzig, Jakob; Berthold, Timo; Heinz, Stefan: Experiments with conflict analysis in mixed integer programming (2017)
  9. Andreatta, G.; Casula, M.; De Francesco, C.; De Giovanni, L.: A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows (2016)
  10. Bergner, Martin; Lübbecke, Marco E.; Witt, Jonas T.: A branch-price-and-cut algorithm for packing cuts in undirected graphs (2016)
  11. Berthold, Timo; Farmer, James; Heinz, Stefan; Perregaard, Michael: Parallelization of the FICO Xpress-Optimizer (2016)
  12. Boland, Natashia; Kalinowski, Thomas; Rigterink, Fabian: New multi-commodity flow formulations for the pooling problem (2016)
  13. Borndörfer, Ralf; Schenker, Sebastian; Skutella, Martin; Strunk, Timo: PolySCIP (2016)
  14. Borraz-Sánchez, Conrado; Bent, Russell; Backhaus, Scott; Hijazi, Hassan; Van Hentenryck, Pascal: Convex relaxations for gas expansion planning (2016)
  15. Boukouvala, Fani; Misener, Ruth; Floudas, Christodoulos A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (2016)
  16. Braun, Gábor; Pokutta, Sebastian: A polyhedral characterization of border bases (2016)
  17. Bruns, Winfried; Sieg, Richard; Söger, Christof: The subdivision of large simplicial cones in normaliz (2016)
  18. Buchheim, Christoph; De Santis, Marianna; Lucidi, Stefano; Rinaldi, Francesco; Trieu, Long: A feasible active set method with reoptimization for convex quadratic mixed-integer programming (2016)
  19. Chrapary, Hagen; Ren, Yue: The software portal swMATH: a state of the art report and next steps (2016)
  20. Csercsik, Dávid: Lying generators: manipulability of centralized payoff mechanisms in electrical energy trade (2016)

previous 1 2 3 4 ... 11 12 13 next

Further publications can be found at: