SCIP

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

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

previous 1 2 3 4 ... 14 15 16 next

  1. Kimura, Keiji; Waki, Hayato: Minimization of Akaike’s information criterion in linear regression analysis via mixed integer nonlinear program (2018)
  2. Lancia, Giuseppe; Serafini, Paolo: Compact extended linear programming models (2018)
  3. Lara, Cristiana L.; Trespalacios, Francisco; Grossmann, Ignacio E.: Global optimization algorithm for capacitated multi-facility continuous location-allocation problems (2018)
  4. Le Bodic, Pierre; Pavelka, Jeffrey W.; Pfetsch, Marc E.; Pokutta, Sebastian: Solving MIPs via scaling-based augmentation (2018)
  5. Lee, Jon; Skipper, Daphne; Speakman, Emily: Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (2018)
  6. Lodi, Andrea; Moradi, Ahmad: Experiments on virtual private network design with concave capacity costs (2018)
  7. López, C. O.; Beasley, J. E.: Packing unequal rectangles and squares in a fixed size circular container using formulation space search (2018)
  8. Malone, Brandon; Kangas, Kustaa; Järvisalo, Matti; Koivisto, Mikko; Myllymäki, Petri: Empirical hardness of finding optimal Bayesian network structures: algorithm selection and runtime prediction (2018)
  9. Montanher, Tiago; Neumaier, Arnold; Domes, Ferenc: A computational study of global optimization solvers on two trust region subproblems (2018)
  10. Pajor, Thomas; Uchoa, Eduardo; Werneck, Renato F.: A robust and scalable algorithm for the Steiner problem in graphs (2018)
  11. Schweiger, Jonas: Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty (2018)
  12. Shinano, Yuji; Berthold, Timo; Heinz, Stefan: ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers (2018)
  13. Thammawichai, Mason; Kerrigan, Eric C.: Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors (2018)
  14. Vigerske, Stefan; Gleixner, Ambros: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (2018)
  15. Wang, Akang; Hanselman, Christopher L.; Gounaris, Chrysanthos E.: A customized branch-and-bound approach for irregular shape nesting (2018)
  16. Witzig, Jakob; Beckenbach, Isabel; Eifler, Leon; Fackeldey, Konstantin; Gleixner, Ambros; Grever, Andreas; Weber, Marcus: Mixed-integer programming for cycle detection in nonreversible Markov processes (2018)
  17. Zhou, Kai; Kılınç, Mustafa R.; Chen, Xi; Sahinidis, Nikolaos V.: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (2018)
  18. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  19. Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with polymake (2017)
  20. Bartlett, Mark; Cussens, James: Integer linear programming for the Bayesian network structure learning problem (2017)

previous 1 2 3 4 ... 14 15 16 next


Further publications can be found at: http://scip.zib.de/#work