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

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

1 2 next

  1. Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo; Vanderbeck, François: A generic exact solver for vehicle routing and related problems (2020)
  2. Arakaki, Rafael Kendy; Usberti, Fábio Luiz: An efficiency-based path-scanning heuristic for the capacitated arc routing problem (2019)
  3. Chassein, André; Dokka, Trivikram; Goerigk, Marc: Algorithms and uncertainty sets for data-driven robust shortest path problems (2019)
  4. Horváth, Markó; Kis, Tamás: Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price (2019)
  5. Koza, David Franz: Liner shipping service scheduling and cargo allocation (2019)
  6. Molnár-Szipai, Richárd; Varga, Anita: Integrating combinatorial algorithms into a linear programming solver (2019)
  7. Pothen, Alex; Ferdous, S. M.; Manne, Fredrik: Approximation algorithms in combinatorial scientific computing (2019)
  8. Samer, Phillippe; Cavalcante, Evellyn; Urrutia, Sebastián; Oppen, Johan: The matching relaxation for a class of generalized set partitioning problems (2019)
  9. Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman: Sequential and parallel algorithms and data structures. The basic toolbox (2019)
  10. Ahat, Betül; Ekim, Tınaz; Taşkın, Z. Caner: Integer programming formulations and Benders decomposition for the maximum induced matching problem (2018)
  11. Arakaki, Rafael Kendy; Usberti, Fábio Luiz: Hybrid genetic algorithm for the open capacitated arc routing problem (2018)
  12. Bérczi, Kristóf; Jüttner, Alpár; Laumanns, Marco; Szabó, Jácint: Arrival time dependent routing policies in public transport (2018)
  13. Diarrassouba, Ibrahima; Labidi, Mohamed Khalil; Mahjoub, Ali Ridha: A hybrid optimization approach for the Steiner (k)-connected network design problem (2018)
  14. Jüttner, Alpár; Madarasi, Péter: VF2++ -- an improved subgraph isomorphism algorithm (2018)
  15. Lersteau, Charly; Rossi, André; Sevaux, Marc: Minimum energy target tracking with coverage guarantee in wireless sensor networks (2018)
  16. Goerigk, Marc; Schmidt, Marie: Line planning with user-optimal route choice (2017)
  17. Kinable, Joris; Smeulders, Bart; Delcour, Eline; Spieksma, Frits C. R.: Exact algorithms for the equitable traveling salesman problem (2017)
  18. 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)
  19. Nguyen, Viet Hung; Weng, Paul: An efficient primal-dual algorithm for fair combinatorial optimization problems (2017)
  20. Barbato, Michele; Grappe, Roland; Lacroix, Mathieu; Wolfler Calvo, Roberto: A set covering approach for the double traveling salesman problem with multiple stacks (2016)

1 2 next