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

Showing results 461 to 480 of 536.
Sorted by year (citations)

previous 1 2 3 ... 22 23 24 25 26 27 next

  1. Lübbecke, Marco; Puchert, Christian: Primal heuristics for branch-and-price algorithms (2012)
  2. Magos, D.; Mourtos, I.; Appa, G.: A polyhedral approach to the \textitalldifferentsystem (2012)
  3. Misener, Ruth; Floudas, Christodoulos A.: Global optimization of mixed-integer models with quadratic and signomial functions: a review (2012)
  4. Oren, Yossef; Renauld, Mathieu; Standaert, François-Xavier; Wool, Avishai: Algebraic side-channel attacks beyond the Hamming weight leakage model (2012)
  5. Yamamura, Kiyotaka; Tamura, Naoya: Finding all solutions of separable systems of piecewise-linear equations using integer programming (2012)
  6. Achterberg, Tobias (ed.); Beck, J. Christopher (ed.): Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23--27, 2011. Proceedings (2011)
  7. Büsing, Christina; Koster, Arie M. C. A.; Kutschka, Manuel: Recoverable robust knapsacks: the discrete scenario case (2011)
  8. Caprara, Alberto; Oswald, Marcus; Reinelt, Gerhard; Schwarz, Robert; Traversi, Emiliano: Optimal linear arrangements using betweenness variables (2011)
  9. Chwatal, Andreas M.; Raidl, Günther R.: Solving the minimum label spanning tree problem by mathematical programming techniques (2011)
  10. Cook, William; Koch, Thorsten; Steffy, Daniel E.; Wolter, Kati: An exact rational mixed-integer programming solver (2011)
  11. D’Ambrosio, Claudia; Lodi, Andrea: Mixed integer nonlinear programming tools: a practical overview (2011)
  12. Fischetti, Matteo; Monaci, Michele: Backdoor branching (2011)
  13. Fischetti, Matteo; Salvagnin, Domenico: A relax-and-cut framework for Gomory mixed-integer cuts (2011)
  14. García, Sergio; Labbé, Martine; Marín, Alfredo: Solving large (p)-median problems with a radius formulation (2011)
  15. Höhn, Wiebke; König, Felix G.; Möhring, Rolf H.; Lübbecke, Marco E.: Integrated sequencing and scheduling in coil coating (2011)
  16. Januschowski, Tim; Pfetsch, Marc E.: Branch-cut-and-propagate for the maximum (k)-colorable subgraph problem with symmetry (2011)
  17. Jovanović, Dejan; de Moura, Leonardo: Cutting to the chase. Solving linear integer arithmetic (2011)
  18. Kaibel, Volker; Peinhardt, Matthias; Pfetsch, Marc E.: Orbitopal fixing (2011)
  19. Leitner, Markus; Raidl, Günther R.: Branch-and-cut-and-price for capacitated connected facility location (2011)
  20. Leitner, Markus; Ruthmair, Mario; Raidl, Günther R.: Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem (2011)

previous 1 2 3 ... 22 23 24 25 26 27 next

Further publications can be found at: