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 23 articles )

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

1 2 next

  1. Huangfu, Q.; Hall, J. A. J.: Parallelizing the dual revised simplex method (2018)
  2. Moazzez, Babak; Soltani, Hossein: Integer programming approach to static monopolies in graphs (2018)
  3. Gassmann, Horand; Ma, Jun; Martin, Kipp: Communication protocols for options and results in a distributed optimization environment (2016)
  4. Gose, Alexander H.; Denton, Brian T.: Sequential bounding methods for two-stage stochastic programs (2016)
  5. Towhidi, Mehdi; Orban, Dominique: Customizing the solution process of COIN-OR’s linear solvers with python (2016)
  6. 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)
  7. Towhidi, Mehdi; Desrosiers, Jacques; Soumis, François: The positive edge criterion within COIN-OR’s CLP (2014)
  8. Belotti, Pietro: Bound reduction using pairs of linear inequalities (2013)
  9. Cornuéjols, Gérard; Margot, François; Nannicini, Giacomo: On the safety of Gomory cut generators (2013)
  10. Janes, Pete P.; Rendell, Alistair P.: Deterministic global optimization in ab-initio quantum chemistry (2013)
  11. Kearfott, Ralph Baker; Muniswamy, Sowmya; Wang, Yi; Li, Xinyu; Wang, Qian: On smooth reformulations and direct non-smooth computations for minimax problems (2013)
  12. Lubin, Miles; Martin, Kipp; Petra, Cosmin G.; Sandıkçı, Burhaneddin: On parallelizing dual decomposition in stochastic integer programming (2013)
  13. Wang, Jiadong; Ralphs, Ted: Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization (2013)
  14. Bonami, Pierre: On optimizing over lift-and-project closures (2012)
  15. 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)
  16. Cornuéjols, Gerard; Nannicini, Giacomo: Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (2011)
  17. Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.; Rudová, Hana: Decomposition, reformulation, and diving in university course timetabling (2010)
  18. Achterberg, Tobias: SCIP: solving constraint integer programs (2009)
  19. Lebbah, Y.: ICOS: a branch and bound based solver for rigorous global optimization (2009)
  20. Dash, Sanjeeb; Günlük, Oktay: On the strength of Gomory mixed-integer cuts as group cuts (2008)

1 2 next