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

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

1 2 3 next

  1. Cartis, Coralia; Yan, Yiming: Active-set prediction for interior point methods using controlled perturbations (2016)
  2. Ferrer Fioriti, Luis María; Hashemi, Vahid; Hermanns, Holger; Turrini, Andrea: Deciding probabilistic automata weak bisimulation: theory and practice (2016)
  3. Gassmann, Horand; Ma, Jun; Martin, Kipp: Communication protocols for options and results in a distributed optimization environment (2016)
  4. Xu, Hong; Kumar, T.K.Satish; Koenig, Sven: A new solver for the minimum weighted vertex cover problem (2016)
  5. Bachoc, Christine; Passuello, Alberto; Thiery, Alain: The density of sets avoiding distance 1 in Euclidean space (2015)
  6. 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
  7. Carbonneau, Réal A.; Caporossi, Gilles; Hansen, Pierre: Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization (2014)
  8. Hutter, Frank; Xu, Lin; Hoos, Holger H.; Leyton-Brown, Kevin: Algorithm runtime prediction: methods & evaluation (2014)
  9. Mandal, B.N.; Koukouvinos, C.: Optimal multi-level supersaturated designs through integer programming (2014)
  10. Bentobache, Mohand; Bibi, Mohand Ouamer: A two-phase support method for solving linear programs: numerical experiments (2012)
  11. Larsen, Paul L.: Fulton’s conjecture for $\overlineM_0,7$ (2012)
  12. Mardia, Kanti V.; Petty, Emma M.; Taylor, Charles C.: Matching markers and unlabeled configurations in protein gels (2012)
  13. Wimmel; Harro; Wolf, Karsten: Applying CEGAR to the Petri net state equation (2012)
  14. Çalışkan, Cenk: A specialized network simplex algorithm for the constrained maximum flow problem (2011)
  15. Cappelen, Alexander W.; Hole, Astri Drange; Sørensen, Erik Ø.; Tungodden, Bertil: The importance of moral reflection and self-reported data in a dictator game with production (2011)
  16. Goovaerts, Marc J.; Kaas, Rob; Laeven, Roger J.A.: Worst case risk measurement: back to the future? (2011)
  17. Li, Mian; Gabriel, Steven A.; Shim, Yohan; Azarm, Shapour: Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning (2011)
  18. Ruiz-Gironés, E.; Roca, X.; Sarrate, J.: Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms (2011)
  19. Hable, Robert: A minimum distance estimator in an imprecise probability model -- computational aspects and applications (2010)
  20. Kleniati, P.M.; Parpas, P.; Rustem, B.: Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (2010)

1 2 3 next