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

Showing results 181 to 200 of 237.
Sorted by year (citations)

previous 1 2 3 ... 8 9 10 11 12 next

  1. Leitner, Markus; Raidl, Günther R.: Branch-and-cut-and-price for capacitated connected facility location (2011)
  2. Leitner, Markus; Ruthmair, Mario; Raidl, Günther R.: Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem (2011)
  3. Puchinger, Jakob; Stuckey, Peter J.; Wallace, Mark G.; Brand, Sebastian: Dantzig-Wolfe decomposition and branch-and-price solving in G12 (2011)
  4. Raack, Christian; Koster, Arie M.C.A.; Orlowski, Sebastian; Wessäly, Roland: On cut-based inequalities for capacitated network design polyhedra (2011)
  5. Tramontani, Andrea: Enhanced mixed integer programming techniques and routing problems (2011)
  6. Weber, Gerhard-Wilhelm; Defterli, Ozlem; Alparslan Gök, Sırma Zeynep; Kropat, Erik: Modeling, inference and optimization of regulatory networks based on time series data (2011)
  7. Wesselmann, Franz; Koberstein, Achim; Suhl, Uwe H.: Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (2011)
  8. Achterberg, Tobias; Raack, Christian: The M CF-separator: Detecting and exploiting multi-commodity flow structures in MIPs (2010)
  9. Bang-Jensen, Jørgen; Chiarandini, Marco; Morling, Peter: A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (2010)
  10. Berthold, Timo; Feydy, Thibaut; Stuckey, Peter J.: Rapid learning for binary programs (2010)
  11. Berthold, Timo; Heinz, Stefan; Lübbecke, Marco E.; Möhring, Rolf H.; Schulz, Jens: A constraint integer programming approach for resource-constrained project scheduling (2010)
  12. Bettinelli, Andrea; Ceselli, Alberto; Righini, Giovanni: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (2010)
  13. Blad, Anton; Gustafsson, Oscar: Integer linear programming-based bit-level optimization for high-speed FIR decimation filter architectures (2010)
  14. Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.; Rudová, Hana: A supernodal formulation of vertex colouring with applications in course timetabling (2010)
  15. Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.; Rudová, Hana: Decomposition, reformulation, and diving in university course timetabling (2010)
  16. Fischetti, Matteo; Salvagnin, Domenico: A relax-and-cut framework for Gomory’s mixed-integer cuts (2010)
  17. Koster, Arie M.C.A.; Muñoz, Xavier: Graphs and algorithms in communication networks on seven league boots (2010)
  18. Luque, Franco M.; Infante-Lopez, Gabriel: Bounding the maximal parsing performance of non-terminally separated grammars (2010)
  19. Milano, Michela; Wallace, Mark: Integrating operations research in constraint programming (2010)
  20. Orlowski, Sebastian; Raack, Christian; Koster, Arie M.C.A.; Baier, Georg; Engel, Thomas; Belotti, Pietro: Branch-and-cut techniques for solving realistic two-layer network design problems (2010)

previous 1 2 3 ... 8 9 10 11 12 next

Further publications can be found at: