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 26 articles , 1 standard article )

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

1 2 next

  1. Arakaki, Rafael Kendy; Usberti, Fábio Luiz: Hybrid genetic algorithm for the open capacitated arc routing problem (2018)
  2. Diarrassouba, Ibrahima; Labidi, Mohamed Khalil; Mahjoub, Ali Ridha: A hybrid optimization approach for the Steiner $k$-connected network design problem (2018)
  3. Jüttner, Alpár; Madarasi, Péter: VF2++ -- an improved subgraph isomorphism algorithm (2018)
  4. Lersteau, Charly; Rossi, André; Sevaux, Marc: Minimum energy target tracking with coverage guarantee in wireless sensor networks (2018)
  5. Goerigk, Marc; Schmidt, Marie: Line planning with user-optimal route choice (2017)
  6. Kinable, Joris; Smeulders, Bart; Delcour, Eline; Spieksma, Frits C. R.: Exact algorithms for the equitable traveling salesman problem (2017)
  7. 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)
  8. Nguyen, Viet Hung; Weng, Paul: An efficient primal-dual algorithm for fair combinatorial optimization problems (2017)
  9. Barbato, Michele; Grappe, Roland; Lacroix, Mathieu; Wolfler Calvo, Roberto: A set covering approach for the double traveling salesman problem with multiple stacks (2016)
  10. Borndörfer, Ralf; Schenker, Sebastian; Skutella, Martin; Strunk, Timo: PolySCIP (2016)
  11. Chassein, André; Goerigk, Marc: A bicriteria approach to robust optimization (2016)
  12. Horváth, Markó; Kis, Tamás: Solving resource constrained shortest path problems with LP-based methods (2016)
  13. Lersteau, Charly; Rossi, André; Sevaux, Marc: Robust scheduling of wireless sensor networks for target tracking under uncertainty (2016)
  14. Rostami, Borzou; Malucelli, Federico; Belotti, Pietro; Gualandi, Stefano: Lower bounding procedure for the asymmetric quadratic traveling salesman problem (2016)
  15. Schmitzer, Bernhard: A sparse multiscale algorithm for dense optimal transport (2016)
  16. Song, Yongjia; Shen, Siqian: Risk-averse shortest path interdiction (2016)
  17. Taccari, Leonardo: Integer programming formulations for the elementary shortest path problem (2016)
  18. Hager, William W.; Hungerford, James T.: Continuous quadratic programming formulations of optimization problems on graphs (2015)
  19. Kovács, Péter: Minimum-cost flow algorithms: an experimental evaluation (2015)
  20. Samer, Phillippe; Urrutia, Sebastián: A branch and cut algorithm for minimum spanning trees under conflict constraints (2015)

1 2 next