LEMON – an Open Source C++ Graph Template Library. This paper introduces LEMON, a generic open source C++ library providing easy-to-use and efficient implementations of graph and network algorithms and related data structures. The basic design concepts, features, and performance of LEMON are compared with similar software packages, namely BGL (Boost Graph Library) and LEDA. LEMON turned out to be a viable alternative to these widely used libraries, and our benchmarks show that it typically outperforms them in efficiency. (Source: http://plato.asu.edu)

References in zbMATH (referenced in 19 articles , 1 standard article )

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

  1. Müller, Johannes C.; Pokutta, Sebastian; Martin, Alexander; Pape, Susanne; Peter, Andrea; Winter, Thomas: Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem (2017)
  2. Barbato, Michele; Grappe, Roland; Lacroix, Mathieu; Wolfler Calvo, Roberto: A set covering approach for the double traveling salesman problem with multiple stacks (2016)
  3. Borndörfer, Ralf; Schenker, Sebastian; Skutella, Martin; Strunk, Timo: PolySCIP (2016)
  4. Chassein, André; Goerigk, Marc: A bicriteria approach to robust optimization (2016)
  5. Horváth, Markó; Kis, Tamás: Solving resource constrained shortest path problems with LP-based methods (2016)
  6. Lersteau, Charly; Rossi, André; Sevaux, Marc: Robust scheduling of wireless sensor networks for target tracking under uncertainty (2016)
  7. Rostami, Borzou; Malucelli, Federico; Belotti, Pietro; Gualandi, Stefano: Lower bounding procedure for the asymmetric quadratic traveling salesman problem (2016)
  8. Schmitzer, Bernhard: A sparse multiscale algorithm for dense optimal transport (2016)
  9. Song, Yongjia; Shen, Siqian: Risk-averse shortest path interdiction (2016)
  10. Taccari, Leonardo: Integer programming formulations for the elementary shortest path problem (2016)
  11. Hager, William W.; Hungerford, James T.: Continuous quadratic programming formulations of optimization problems on graphs (2015)
  12. Kovács, Péter: Minimum-cost flow algorithms: an experimental evaluation (2015)
  13. Samer, Phillippe; Urrutia, Sebastián: A branch and cut algorithm for minimum spanning trees under conflict constraints (2015)
  14. Coelho, Leandro C.; Cordeau, Jean-François; Laporte, Gilbert: Heuristics for dynamic and stochastic inventory-routing (2014)
  15. Fagginger Auer, B.O.; Bisseling, R.H.: Efficient matching for column intersection graphs (2014)
  16. Tam, Gary K.L.; Martin, Ralph R.; Rosin, Paul L.; Lai, Yu-Kun: Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry (2014)
  17. Bodur, Merve; Ekim, Tinaz; Taşkın, Z. Caner: Decomposition algorithms for solving the minimum weight maximal matching problem (2013)
  18. Goerigk, Marc; Grün, Bob; Heßler, Philipp: Branch and bound algorithms for the bus evacuation problem (2013)
  19. Song, Yongjia; Luedtke, James R.: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (2013)