1 %%%%% Defining LEMON %%%%%
5 title = {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
6 {O}ptimization in {N}etworks},
7 howpublished = {\url{http://lemon.cs.elte.hu/}},
13 title = {{EGRES} -- {E}gerv{\'a}ry {R}esearch {G}roup on
14 {C}ombinatorial {O}ptimization},
15 url = {http://www.cs.elte.hu/egres/}
20 title = {{COIN-OR} -- {C}omputational {I}nfrastructure for
21 {O}perations {R}esearch},
22 url = {http://www.coin-or.org/}
26 %%%%% Other libraries %%%%%%
30 title = {{B}oost {C++} {L}ibraries},
31 url = {http://www.boost.org/}
35 author = {Jeremy G. Siek and Lee-Quan Lee and Andrew
37 title = {The Boost Graph Library: User Guide and Reference
39 publisher = {Addison-Wesley},
45 title = {{LEDA} -- {L}ibrary of {E}fficient {D}ata {T}ypes and
47 url = {http://www.algorithmic-solutions.com/}
51 author = {Kurt Mehlhorn and Stefan N{\"a}her},
52 title = {{LEDA}: {A} platform for combinatorial and geometric
54 isbn = {0-521-56329-1},
55 publisher = {Cambridge University Press},
56 address = {New York, NY, USA},
61 %%%%% Tools that LEMON depends on %%%%%
65 title = {{CMake} -- {C}ross {P}latform {M}ake},
66 url = {http://www.cmake.org/}
71 title = {{Doxygen} -- {S}ource code documentation generator
73 url = {http://www.doxygen.org/}
77 %%%%% LP/MIP libraries %%%%%
81 title = {{GLPK} -- {GNU} {L}inear {P}rogramming {K}it},
82 url = {http://www.gnu.org/software/glpk/}
87 title = {{Clp} -- {Coin-Or} {L}inear {P}rogramming},
88 url = {http://projects.coin-or.org/Clp/}
93 title = {{Cbc} -- {Coin-Or} {B}ranch and {C}ut},
94 url = {http://projects.coin-or.org/Cbc/}
99 title = {{ILOG} {CPLEX}},
100 url = {http://www.ilog.com/}
105 title = {{SoPlex} -- {T}he {S}equential {O}bject-{O}riented
107 url = {http://soplex.zib.de/}
111 %%%%% General books %%%%%
113 @book{amo93networkflows,
114 author = {Ravindra K. Ahuja and Thomas L. Magnanti and James
116 title = {Network Flows: Theory, Algorithms, and Applications},
117 publisher = {Prentice-Hall, Inc.},
120 isbn = {978-0136175490}
123 @book{schrijver03combinatorial,
124 author = {Alexander Schrijver},
125 title = {Combinatorial Optimization: Polyhedra and Efficiency},
126 publisher = {Springer-Verlag},
128 isbn = {978-3540443896}
131 @book{clrs01algorithms,
132 author = {Thomas H. Cormen and Charles E. Leiserson and Ronald
133 L. Rivest and Clifford Stein},
134 title = {Introduction to Algorithms},
135 publisher = {The MIT Press},
140 @book{stroustrup00cpp,
141 author = {Bjarne Stroustrup},
142 title = {The C++ Programming Language},
144 publisher = {Addison-Wesley Professional},
151 %%%%% Maximum flow algorithms %%%%%
153 @inproceedings{goldberg86newapproach,
154 author = {Andrew V. Goldberg and Robert E. Tarjan},
155 title = {A new approach to the maximum flow problem},
156 booktitle = {STOC '86: Proceedings of the Eighteenth Annual ACM
157 Symposium on Theory of Computing},
159 publisher = {ACM Press},
160 address = {New York, NY},
164 @article{dinic70algorithm,
165 author = {E. A. Dinic},
166 title = {Algorithm for solution of a problem of maximum flow
167 in a network with power estimation},
168 journal = {Soviet Math. Doklady},
174 @article{goldberg08partial,
175 author = {Andrew V. Goldberg},
176 title = {The Partial Augment-Relabel Algorithm for the
177 Maximum Flow Problem},
178 journal = {16th Annual European Symposium on Algorithms},
183 @article{sleator83dynamic,
184 author = {Daniel D. Sleator and Robert E. Tarjan},
185 title = {A data structure for dynamic trees},
186 journal = {Journal of Computer and System Sciences},
194 %%%%% Minimum mean cycle algorithms %%%%%
196 @article{karp78characterization,
197 author = {Richard M. Karp},
198 title = {A characterization of the minimum cycle mean in a
200 journal = {Discrete Math.},
206 @article{dasdan98minmeancycle,
207 author = {Ali Dasdan and Rajesh K. Gupta},
208 title = {Faster Maximum and Minimum Mean Cycle Alogrithms for
209 System Performance Analysis},
210 journal = {IEEE Transactions on Computer-Aided Design of
211 Integrated Circuits and Systems},
219 %%%%% Minimum cost flow algorithms %%%%%
221 @article{klein67primal,
222 author = {Morton Klein},
223 title = {A primal method for minimal cost flows with
224 applications to the assignment and transportation
226 journal = {Management Science},
232 @inproceedings{goldberg88cyclecanceling,
233 author = {Andrew V. Goldberg and Robert E. Tarjan},
234 title = {Finding minimum-cost circulations by canceling
236 booktitle = {STOC '88: Proceedings of the Twentieth Annual ACM
237 Symposium on Theory of Computing},
239 publisher = {ACM Press},
240 address = {New York, NY},
244 @article{edmondskarp72theoretical,
245 author = {Jack Edmonds and Richard M. Karp},
246 title = {Theoretical improvements in algorithmic efficiency
247 for network flow problems},
248 journal = {Journal of the ACM},
255 @inproceedings{goldberg87approximation,
256 author = {Andrew V. Goldberg and Robert E. Tarjan},
257 title = {Solving minimum-cost flow problems by successive
259 booktitle = {STOC '87: Proceedings of the Nineteenth Annual ACM
260 Symposium on Theory of Computing},
262 publisher = {ACM Press},
263 address = {New York, NY},
267 @article{goldberg90finding,
268 author = {Andrew V. Goldberg and Robert E. Tarjan},
269 title = {Finding Minimum-Cost Circulations by Successive
271 journal = {Mathematics of Operations Research},
278 @article{goldberg97efficient,
279 author = {Andrew V. Goldberg},
280 title = {An Efficient Implementation of a Scaling
281 Minimum-Cost Flow Algorithm},
282 journal = {Journal of Algorithms},
289 @article{bunnagel98efficient,
290 author = {Ursula B{\"u}nnagel and Bernhard Korte and Jens
292 title = {Efficient implementation of the {G}oldberg-{T}arjan
293 minimum-cost flow algorithm},
294 journal = {Optimization Methods and Software},
300 @mastersthesis{kellyoneill91netsimplex,
301 author = {Damian J. Kelly and Garrett M. O'Neill},
302 title = {The Minimum Cost Flow Problem and The Network
304 school = {University College},
305 address = {Dublin, Ireland},
310 @techreport{lobel96networksimplex,
311 author = {Andreas L{\"o}bel},
312 title = {Solving large-scale real-world minimum-cost flow
313 problems by a network simplex method},
314 institution = {Konrad-Zuse-Zentrum fur Informationstechnik Berlin
316 address = {Berlin, Germany},
321 @article{frangioni06computational,
322 author = {Antonio Frangioni and Antonio Manca},
323 title = {A Computational Study of Cost Reoptimization for
324 Min-Cost Flow Problems},
325 journal = {INFORMS Journal On Computing},