lp_solve

lp_solve is a free (see LGPL for the GNU lesser general public license) linear (integer) programming solver based on the revised simplex method and the Branch-and-bound method for the integers. It contains full source, examples and manuals.

Keywords for this software

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

References in zbMATH (referenced in 59 articles )

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

1 2 3 next

  1. Chatterjee, Krishnendu; Pavlogiannis, Andreas; Kößler, Alexander; Schmid, Ulrich: Automated competitive analysis of real-time scheduling with graph games (2018)
  2. Liebscher, Volkmar: New Gromov-inspired metrics on phylogenetic tree space (2018)
  3. Fendl, Hannes; Neumaier, Arnold; Schichl, Hermann: Certificates of infeasibility via nonsmooth optimization (2017)
  4. Knoop, Jens; Kovács, Laura; Zwirchmayr, Jakob: Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution (2017)
  5. Cartis, Coralia; Yan, Yiming: Active-set prediction for interior point methods using controlled perturbations (2016)
  6. Ferrer Fioriti, Luis María; Hashemi, Vahid; Hermanns, Holger; Turrini, Andrea: Deciding probabilistic automata weak bisimulation: theory and practice (2016)
  7. Gassmann, Horand; Ma, Jun; Martin, Kipp: Communication protocols for options and results in a distributed optimization environment (2016)
  8. Shen, Jingjing; Kosinka, Jiří; Sabin, Malcolm; Dodgson, Neil: Converting a CAD model into a non-uniform subdivision surface (2016)
  9. Xu, Hong; Kumar, T.K.Satish; Koenig, Sven: A new solver for the minimum weighted vertex cover problem (2016)
  10. Bachoc, Christine; Passuello, Alberto; Thiery, Alain: The density of sets avoiding distance 1 in Euclidean space (2015)
  11. Hannes Fendl, Hermann Schichl: A feasible second order bundle algorithm for nonsmooth nonconvex optimization problems with inequality constraints: II. Implementation and numerical results (2015) arXiv
  12. Bondarenko, V.A.; Nikolaev, A.V.; Symanovich, M.E.; Shemyakin, R.O.: On a recognition problem on cut polytope relaxations (2014)
  13. Carbonneau, Réal A.; Caporossi, Gilles; Hansen, Pierre: Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization (2014)
  14. Fontana, Roberto: Fractional factorial designs for model-based evaluation of customer preferences (2014)
  15. Hutter, Frank; Xu, Lin; Hoos, Holger H.; Leyton-Brown, Kevin: Algorithm runtime prediction: methods & evaluation (2014)
  16. Mandal, B.N.; Koukouvinos, C.: Optimal multi-level supersaturated designs through integer programming (2014)
  17. Roger Koenker and Ivan Mizera: Convex Optimization in R (2014)
  18. Roberto Fontana; Sabrina Sampò: Minimum-Size Mixed-Level Orthogonal Fractional Factorial Designs Generation: A SAS-Based Algorithm (2013)
  19. Bentobache, Mohand; Bibi, Mohand Ouamer: A two-phase support method for solving linear programs: numerical experiments (2012)
  20. Larsen, Paul L.: Fulton’s conjecture for $\overlineM_0,7$ (2012)

1 2 3 next