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

Showing results 281 to 300 of 331.
Sorted by year (citations)

previous 1 2 3 ... 13 14 15 16 17 next

  1. Wesselmann, Franz; Koberstein, Achim; Suhl, Uwe H.: Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (2011)
  2. Achterberg, Tobias; Raack, Christian: The M CF-separator: Detecting and exploiting multi-commodity flow structures in MIPs (2010)
  3. Bang-Jensen, Jørgen; Chiarandini, Marco; Morling, Peter: A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (2010)
  4. Berthold, Timo; Feydy, Thibaut; Stuckey, Peter J.: Rapid learning for binary programs (2010)
  5. 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)
  6. Bettinelli, Andrea; Ceselli, Alberto; Righini, Giovanni: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (2010)
  7. Blad, Anton; Gustafsson, Oscar: Integer linear programming-based bit-level optimization for high-speed FIR decimation filter architectures (2010)
  8. Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.; Rudová, Hana: A supernodal formulation of vertex colouring with applications in course timetabling (2010)
  9. Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.; Rudová, Hana: Decomposition, reformulation, and diving in university course timetabling (2010)
  10. Fischetti, Matteo; Salvagnin, Domenico: A relax-and-cut framework for Gomory’s mixed-integer cuts (2010)
  11. Koster, Arie M. C. A.; Muñoz, Xavier: Graphs and algorithms in communication networks on seven league boots (2010)
  12. Luque, Franco M.; Infante-Lopez, Gabriel: Bounding the maximal parsing performance of non-terminally separated grammars (2010)
  13. Milano, Michela; Wallace, Mark: Integrating operations research in constraint programming (2010)
  14. 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)
  15. Rendl, Franz; Rinaldi, Giovanni; Wiegele, Angelika: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (2010)
  16. Stuckey, Peter J.; Becket, Ralph; Fischer, Julien: Philosophy of the MiniZinc challenge (2010)
  17. Wallace, Chris: ZI round, a MIP rounding heuristic (2010)
  18. Wojtaszek, Daniel T.; Chinneck, John W.: Faster MIP solutions via new node selection rules (2010)
  19. Achterberg, Tobias: SCIP: solving constraint integer programs (2009)
  20. Berthold, Timo; Heinz, Stefan; Pfetsch, Marc E.: Nonlinear pseudo-Boolean optimization: Relaxation or propagation? (2009) ioport

previous 1 2 3 ... 13 14 15 16 17 next

Further publications can be found at: