kpeter@743: %%%%% Defining LEMON %%%%% kpeter@743: kpeter@743: @misc{lemon, kpeter@743: key = {LEMON}, kpeter@743: title = {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and kpeter@743: {O}ptimization in {N}etworks}, kpeter@1002: howpublished = {\url{http://lemon.cs.elte.hu/}} kpeter@743: } kpeter@743: kpeter@743: @misc{egres, kpeter@743: key = {EGRES}, kpeter@743: title = {{EGRES} -- {E}gerv{\'a}ry {R}esearch {G}roup on kpeter@743: {C}ombinatorial {O}ptimization}, kpeter@754: url = {http://www.cs.elte.hu/egres/} kpeter@743: } kpeter@743: kpeter@743: @misc{coinor, kpeter@743: key = {COIN-OR}, kpeter@743: title = {{COIN-OR} -- {C}omputational {I}nfrastructure for kpeter@743: {O}perations {R}esearch}, kpeter@754: url = {http://www.coin-or.org/} kpeter@743: } kpeter@743: kpeter@743: kpeter@1051: %%%%% Papers related to LEMON %%%%% kpeter@1051: kpeter@1051: @article{DezsoJuttnerKovacs11Lemon, kpeter@1051: author = {B. Dezs{\H o} and A. J\"uttner and P. Kov\'acs}, kpeter@1051: title = {{LEMON} -- an open source {C++} graph template library}, kpeter@1051: journal = {Electronic Notes in Theoretical Computer Science}, kpeter@1051: volume = {264}, kpeter@1051: pages = {23--45}, kpeter@1051: year = {2011}, kpeter@1051: note = {Proc. 2nd Workshop on Generative Technologies} kpeter@1051: } kpeter@1051: kpeter@1051: @article{KiralyKovacs12MCF, kpeter@1051: author = {Z. Kir\'aly and P. Kov\'acs}, kpeter@1051: title = {Efficient implementations of minimum-cost flow algorithms}, kpeter@1051: journal = {Acta Universitatis Sapientiae, Informatica}, kpeter@1051: year = {2012}, kpeter@1051: volume = {4}, kpeter@1051: pages = {67--118} kpeter@1051: } kpeter@1051: kpeter@1051: kpeter@743: %%%%% Other libraries %%%%%% kpeter@743: kpeter@743: @misc{boost, kpeter@743: key = {Boost}, kpeter@743: title = {{B}oost {C++} {L}ibraries}, kpeter@754: url = {http://www.boost.org/} kpeter@743: } kpeter@743: kpeter@743: @book{bglbook, kpeter@743: author = {Jeremy G. Siek and Lee-Quan Lee and Andrew kpeter@743: Lumsdaine}, kpeter@743: title = {The Boost Graph Library: User Guide and Reference kpeter@743: Manual}, kpeter@743: publisher = {Addison-Wesley}, kpeter@743: year = 2002 kpeter@743: } kpeter@743: kpeter@743: @misc{leda, kpeter@743: key = {LEDA}, kpeter@743: title = {{LEDA} -- {L}ibrary of {E}fficient {D}ata {T}ypes and kpeter@743: {A}lgorithms}, kpeter@754: url = {http://www.algorithmic-solutions.com/} kpeter@743: } kpeter@743: kpeter@743: @book{ledabook, kpeter@743: author = {Kurt Mehlhorn and Stefan N{\"a}her}, kpeter@743: title = {{LEDA}: {A} platform for combinatorial and geometric kpeter@743: computing}, kpeter@743: isbn = {0-521-56329-1}, kpeter@743: publisher = {Cambridge University Press}, kpeter@743: address = {New York, NY, USA}, kpeter@743: year = 1999 kpeter@743: } kpeter@743: kpeter@743: kpeter@743: %%%%% Tools that LEMON depends on %%%%% kpeter@743: kpeter@743: @misc{cmake, kpeter@743: key = {CMake}, kpeter@743: title = {{CMake} -- {C}ross {P}latform {M}ake}, kpeter@754: url = {http://www.cmake.org/} kpeter@743: } kpeter@743: kpeter@743: @misc{doxygen, kpeter@743: key = {Doxygen}, kpeter@743: title = {{Doxygen} -- {S}ource code documentation generator kpeter@743: tool}, kpeter@754: url = {http://www.doxygen.org/} kpeter@743: } kpeter@743: kpeter@743: kpeter@743: %%%%% LP/MIP libraries %%%%% kpeter@743: kpeter@743: @misc{glpk, kpeter@743: key = {GLPK}, kpeter@743: title = {{GLPK} -- {GNU} {L}inear {P}rogramming {K}it}, kpeter@754: url = {http://www.gnu.org/software/glpk/} kpeter@743: } kpeter@743: kpeter@743: @misc{clp, kpeter@743: key = {Clp}, kpeter@743: title = {{Clp} -- {Coin-Or} {L}inear {P}rogramming}, kpeter@754: url = {http://projects.coin-or.org/Clp/} kpeter@743: } kpeter@743: kpeter@743: @misc{cbc, kpeter@743: key = {Cbc}, kpeter@743: title = {{Cbc} -- {Coin-Or} {B}ranch and {C}ut}, kpeter@754: url = {http://projects.coin-or.org/Cbc/} kpeter@743: } kpeter@743: kpeter@743: @misc{cplex, kpeter@743: key = {CPLEX}, kpeter@743: title = {{ILOG} {CPLEX}}, kpeter@754: url = {http://www.ilog.com/} kpeter@743: } kpeter@743: kpeter@743: @misc{soplex, kpeter@743: key = {SoPlex}, kpeter@743: title = {{SoPlex} -- {T}he {S}equential {O}bject-{O}riented kpeter@743: {S}implex}, kpeter@754: url = {http://soplex.zib.de/} kpeter@743: } kpeter@743: kpeter@743: kpeter@743: %%%%% General books %%%%% kpeter@743: kpeter@743: @book{amo93networkflows, kpeter@743: author = {Ravindra K. Ahuja and Thomas L. Magnanti and James kpeter@743: B. Orlin}, kpeter@743: title = {Network Flows: Theory, Algorithms, and Applications}, kpeter@743: publisher = {Prentice-Hall, Inc.}, kpeter@743: year = 1993, kpeter@743: month = feb, kpeter@743: isbn = {978-0136175490} kpeter@743: } kpeter@743: kpeter@743: @book{schrijver03combinatorial, kpeter@743: author = {Alexander Schrijver}, kpeter@743: title = {Combinatorial Optimization: Polyhedra and Efficiency}, kpeter@743: publisher = {Springer-Verlag}, kpeter@743: year = 2003, kpeter@743: isbn = {978-3540443896} kpeter@743: } kpeter@743: kpeter@743: @book{clrs01algorithms, kpeter@743: author = {Thomas H. Cormen and Charles E. Leiserson and Ronald kpeter@743: L. Rivest and Clifford Stein}, kpeter@743: title = {Introduction to Algorithms}, kpeter@743: publisher = {The MIT Press}, kpeter@743: year = 2001, kpeter@743: edition = {2nd} kpeter@743: } kpeter@743: kpeter@743: @book{stroustrup00cpp, kpeter@743: author = {Bjarne Stroustrup}, kpeter@743: title = {The C++ Programming Language}, kpeter@743: edition = {3rd}, kpeter@743: publisher = {Addison-Wesley Professional}, kpeter@743: isbn = 0201700735, kpeter@743: month = {February}, kpeter@743: year = 2000 kpeter@743: } kpeter@743: kpeter@743: kpeter@743: %%%%% Maximum flow algorithms %%%%% kpeter@743: kpeter@755: @article{edmondskarp72theoretical, kpeter@755: author = {Jack Edmonds and Richard M. Karp}, kpeter@755: title = {Theoretical improvements in algorithmic efficiency kpeter@755: for network flow problems}, kpeter@755: journal = {Journal of the ACM}, kpeter@755: year = 1972, kpeter@755: volume = 19, kpeter@755: number = 2, kpeter@755: pages = {248-264} kpeter@755: } kpeter@755: kpeter@755: @article{goldberg88newapproach, kpeter@743: author = {Andrew V. Goldberg and Robert E. Tarjan}, kpeter@743: title = {A new approach to the maximum flow problem}, kpeter@755: journal = {Journal of the ACM}, kpeter@755: year = 1988, kpeter@755: volume = 35, kpeter@755: number = 4, kpeter@755: pages = {921-940} kpeter@743: } kpeter@743: kpeter@743: @article{dinic70algorithm, kpeter@743: author = {E. A. Dinic}, kpeter@743: title = {Algorithm for solution of a problem of maximum flow kpeter@743: in a network with power estimation}, kpeter@743: journal = {Soviet Math. Doklady}, kpeter@743: year = 1970, kpeter@743: volume = 11, kpeter@743: pages = {1277-1280} kpeter@743: } kpeter@743: kpeter@743: @article{goldberg08partial, kpeter@743: author = {Andrew V. Goldberg}, kpeter@743: title = {The Partial Augment-Relabel Algorithm for the kpeter@743: Maximum Flow Problem}, kpeter@743: journal = {16th Annual European Symposium on Algorithms}, kpeter@743: year = 2008, kpeter@743: pages = {466-477} kpeter@743: } kpeter@743: kpeter@743: @article{sleator83dynamic, kpeter@743: author = {Daniel D. Sleator and Robert E. Tarjan}, kpeter@743: title = {A data structure for dynamic trees}, kpeter@743: journal = {Journal of Computer and System Sciences}, kpeter@743: year = 1983, kpeter@743: volume = 26, kpeter@743: number = 3, kpeter@743: pages = {362-391} kpeter@743: } kpeter@743: kpeter@743: kpeter@743: %%%%% Minimum mean cycle algorithms %%%%% kpeter@743: kpeter@743: @article{karp78characterization, kpeter@743: author = {Richard M. Karp}, kpeter@743: title = {A characterization of the minimum cycle mean in a kpeter@743: digraph}, kpeter@743: journal = {Discrete Math.}, kpeter@743: year = 1978, kpeter@743: volume = 23, kpeter@743: pages = {309-311} kpeter@743: } kpeter@743: kpeter@1002: @article{hartmann93finding, kpeter@1002: author = {Mark Hartmann and James B. Orlin}, kpeter@1002: title = {Finding minimum cost to time ratio cycles with small kpeter@1002: integral transit times}, kpeter@1002: journal = {Networks}, kpeter@1002: year = 1993, kpeter@1002: volume = 23, kpeter@1002: pages = {567-574} kpeter@1002: } kpeter@1002: kpeter@743: @article{dasdan98minmeancycle, kpeter@743: author = {Ali Dasdan and Rajesh K. Gupta}, kpeter@743: title = {Faster Maximum and Minimum Mean Cycle Alogrithms for kpeter@743: System Performance Analysis}, kpeter@743: journal = {IEEE Transactions on Computer-Aided Design of kpeter@743: Integrated Circuits and Systems}, kpeter@743: year = 1998, kpeter@743: volume = 17, kpeter@743: number = 10, kpeter@743: pages = {889-899} kpeter@743: } kpeter@743: kpeter@1002: @article{dasdan04experimental, kpeter@1002: author = {Ali Dasdan}, kpeter@1002: title = {Experimental analysis of the fastest optimum cycle kpeter@1002: ratio and mean algorithms}, kpeter@1002: journal = {ACM Trans. Des. Autom. Electron. Syst.}, kpeter@1002: year = 2004, kpeter@1002: volume = 9, kpeter@1002: issue = 4, kpeter@1002: pages = {385-418} kpeter@1002: } kpeter@1002: kpeter@743: kpeter@743: %%%%% Minimum cost flow algorithms %%%%% kpeter@743: kpeter@743: @article{klein67primal, kpeter@743: author = {Morton Klein}, kpeter@743: title = {A primal method for minimal cost flows with kpeter@743: applications to the assignment and transportation kpeter@743: problems}, kpeter@743: journal = {Management Science}, kpeter@743: year = 1967, kpeter@743: volume = 14, kpeter@743: pages = {205-220} kpeter@743: } kpeter@743: kpeter@755: @article{goldberg89cyclecanceling, kpeter@743: author = {Andrew V. Goldberg and Robert E. Tarjan}, kpeter@743: title = {Finding minimum-cost circulations by canceling kpeter@743: negative cycles}, kpeter@755: journal = {Journal of the ACM}, kpeter@755: year = 1989, kpeter@755: volume = 36, kpeter@755: number = 4, kpeter@755: pages = {873-886} kpeter@743: } kpeter@743: kpeter@755: @article{goldberg90approximation, kpeter@743: author = {Andrew V. Goldberg and Robert E. Tarjan}, kpeter@743: title = {Finding Minimum-Cost Circulations by Successive kpeter@743: Approximation}, kpeter@743: journal = {Mathematics of Operations Research}, kpeter@743: year = 1990, kpeter@743: volume = 15, kpeter@743: number = 3, kpeter@743: pages = {430-466} kpeter@743: } kpeter@743: kpeter@743: @article{goldberg97efficient, kpeter@743: author = {Andrew V. Goldberg}, kpeter@743: title = {An Efficient Implementation of a Scaling kpeter@743: Minimum-Cost Flow Algorithm}, kpeter@743: journal = {Journal of Algorithms}, kpeter@743: year = 1997, kpeter@743: volume = 22, kpeter@743: number = 1, kpeter@743: pages = {1-29} kpeter@743: } kpeter@743: kpeter@743: @article{bunnagel98efficient, kpeter@743: author = {Ursula B{\"u}nnagel and Bernhard Korte and Jens kpeter@743: Vygen}, kpeter@743: title = {Efficient implementation of the {G}oldberg-{T}arjan kpeter@743: minimum-cost flow algorithm}, kpeter@743: journal = {Optimization Methods and Software}, kpeter@743: year = 1998, kpeter@743: volume = 10, kpeter@743: pages = {157-174} kpeter@743: } kpeter@743: kpeter@755: @book{dantzig63linearprog, kpeter@755: author = {George B. Dantzig}, kpeter@755: title = {Linear Programming and Extensions}, kpeter@755: publisher = {Princeton University Press}, kpeter@755: year = 1963 kpeter@755: } kpeter@755: kpeter@743: @mastersthesis{kellyoneill91netsimplex, kpeter@743: author = {Damian J. Kelly and Garrett M. O'Neill}, kpeter@743: title = {The Minimum Cost Flow Problem and The Network kpeter@743: Simplex Method}, kpeter@743: school = {University College}, kpeter@743: address = {Dublin, Ireland}, kpeter@743: year = 1991, kpeter@904: month = sep kpeter@743: } kpeter@904: kpeter@904: %%%%% Other algorithms %%%%% kpeter@904: kpeter@904: @article{grosso08maxclique, kpeter@904: author = {Andrea Grosso and Marco Locatelli and Wayne Pullan}, kpeter@904: title = {Simple ingredients leading to very efficient kpeter@904: heuristics for the maximum clique problem}, kpeter@904: journal = {Journal of Heuristics}, kpeter@904: year = 2008, kpeter@904: volume = 14, kpeter@904: number = 6, kpeter@904: pages = {587--612} kpeter@904: } alpar@1142: alpar@1142: @article{cordella2004sub, kpeter@1153: author = {Cordella, Luigi P. and Foggia, Pasquale and Sansone, kpeter@1153: Carlo and Vento, Mario}, kpeter@1153: title = {A (sub)graph isomorphism algorithm for matching alpar@1142: large graphs}, kpeter@1153: journal = {IEEE Transactions on Pattern Analysis and Machine kpeter@1153: Intelligence}, kpeter@1153: volume = 26, kpeter@1153: number = 10, kpeter@1153: pages = {1367--1372}, kpeter@1153: year = 2004 alpar@1142: }