CLP

Clp (Coin-or linear programming) is an open-source linear programming solver written in C++. It is primarily meant to be used as a callable library, but a basic, stand-alone executable version is also available (Source: http://plato.asu.edu)

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 20 articles )

Showing results 1 to 20 of 20.
Sorted by year (citations)

  1. Gassmann, Horand; Ma, Jun; Martin, Kipp: Communication protocols for options and results in a distributed optimization environment (2016)
  2. Gose, Alexander H.; Denton, Brian T.: Sequential bounding methods for two-stage stochastic programs (2016)
  3. Rudan, János; Szederkényi, Gábor; Hangos, Katalin M.; Péni, Tamás: Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (2014)
  4. Towhidi, Mehdi; Desrosiers, Jacques; Soumis, François: The positive edge criterion within COIN-OR’s CLP (2014)
  5. Belotti, Pietro: Bound reduction using pairs of linear inequalities (2013)
  6. Cornuéjols, Gérard; Margot, François; Nannicini, Giacomo: On the safety of Gomory cut generators (2013)
  7. Janes, Pete P.; Rendell, Alistair P.: Deterministic global optimization in ab-initio quantum chemistry (2013)
  8. Kearfott, Ralph Baker; Muniswamy, Sowmya; Wang, Yi; Li, Xinyu; Wang, Qian: On smooth reformulations and direct non-smooth computations for minimax problems (2013)
  9. Lubin, Miles; Martin, Kipp; Petra, Cosmin G.; Sandıkçı, Burhaneddin: On parallelizing dual decomposition in stochastic integer programming (2013)
  10. Wang, Jiadong; Ralphs, Ted: Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization (2013)
  11. Bonami, Pierre: On optimizing over lift-and-project closures (2012)
  12. 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)
  13. Cornuéjols, Gerard; Nannicini, Giacomo: Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (2011)
  14. Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.; Rudová, Hana: Decomposition, reformulation, and diving in university course timetabling (2010)
  15. Achterberg, Tobias: SCIP: solving constraint integer programs (2009)
  16. Lebbah, Y.: ICOS: a branch and bound based solver for rigorous global optimization (2009)
  17. Dash, Sanjeeb; Günlük, Oktay: On the strength of Gomory mixed-integer cuts as group cuts (2008)
  18. Achterberg, Tobias; Koch, Thorsten; Martin, Alexander: MIPLIB 2003 (2006)
  19. Barahona, Francisco; Ladányi, László: Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut (2006)
  20. Dash, Sanjeeb; Günlük, Oktay: Valid inequalities based on the interpolation procedure (2006)