kpeter@790
|
1 |
%%%%% Defining LEMON %%%%%
|
kpeter@790
|
2 |
|
kpeter@790
|
3 |
@misc{lemon,
|
kpeter@790
|
4 |
key = {LEMON},
|
kpeter@790
|
5 |
title = {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
|
kpeter@790
|
6 |
{O}ptimization in {N}etworks},
|
kpeter@790
|
7 |
howpublished = {\url{http://lemon.cs.elte.hu/}},
|
kpeter@790
|
8 |
year = 2009
|
kpeter@790
|
9 |
}
|
kpeter@790
|
10 |
|
kpeter@790
|
11 |
@misc{egres,
|
kpeter@790
|
12 |
key = {EGRES},
|
kpeter@790
|
13 |
title = {{EGRES} -- {E}gerv{\'a}ry {R}esearch {G}roup on
|
kpeter@790
|
14 |
{C}ombinatorial {O}ptimization},
|
kpeter@801
|
15 |
url = {http://www.cs.elte.hu/egres/}
|
kpeter@790
|
16 |
}
|
kpeter@790
|
17 |
|
kpeter@790
|
18 |
@misc{coinor,
|
kpeter@790
|
19 |
key = {COIN-OR},
|
kpeter@790
|
20 |
title = {{COIN-OR} -- {C}omputational {I}nfrastructure for
|
kpeter@790
|
21 |
{O}perations {R}esearch},
|
kpeter@801
|
22 |
url = {http://www.coin-or.org/}
|
kpeter@790
|
23 |
}
|
kpeter@790
|
24 |
|
kpeter@790
|
25 |
|
kpeter@790
|
26 |
%%%%% Other libraries %%%%%%
|
kpeter@790
|
27 |
|
kpeter@790
|
28 |
@misc{boost,
|
kpeter@790
|
29 |
key = {Boost},
|
kpeter@790
|
30 |
title = {{B}oost {C++} {L}ibraries},
|
kpeter@801
|
31 |
url = {http://www.boost.org/}
|
kpeter@790
|
32 |
}
|
kpeter@790
|
33 |
|
kpeter@790
|
34 |
@book{bglbook,
|
kpeter@790
|
35 |
author = {Jeremy G. Siek and Lee-Quan Lee and Andrew
|
kpeter@790
|
36 |
Lumsdaine},
|
kpeter@790
|
37 |
title = {The Boost Graph Library: User Guide and Reference
|
kpeter@790
|
38 |
Manual},
|
kpeter@790
|
39 |
publisher = {Addison-Wesley},
|
kpeter@790
|
40 |
year = 2002
|
kpeter@790
|
41 |
}
|
kpeter@790
|
42 |
|
kpeter@790
|
43 |
@misc{leda,
|
kpeter@790
|
44 |
key = {LEDA},
|
kpeter@790
|
45 |
title = {{LEDA} -- {L}ibrary of {E}fficient {D}ata {T}ypes and
|
kpeter@790
|
46 |
{A}lgorithms},
|
kpeter@801
|
47 |
url = {http://www.algorithmic-solutions.com/}
|
kpeter@790
|
48 |
}
|
kpeter@790
|
49 |
|
kpeter@790
|
50 |
@book{ledabook,
|
kpeter@790
|
51 |
author = {Kurt Mehlhorn and Stefan N{\"a}her},
|
kpeter@790
|
52 |
title = {{LEDA}: {A} platform for combinatorial and geometric
|
kpeter@790
|
53 |
computing},
|
kpeter@790
|
54 |
isbn = {0-521-56329-1},
|
kpeter@790
|
55 |
publisher = {Cambridge University Press},
|
kpeter@790
|
56 |
address = {New York, NY, USA},
|
kpeter@790
|
57 |
year = 1999
|
kpeter@790
|
58 |
}
|
kpeter@790
|
59 |
|
kpeter@790
|
60 |
|
kpeter@790
|
61 |
%%%%% Tools that LEMON depends on %%%%%
|
kpeter@790
|
62 |
|
kpeter@790
|
63 |
@misc{cmake,
|
kpeter@790
|
64 |
key = {CMake},
|
kpeter@790
|
65 |
title = {{CMake} -- {C}ross {P}latform {M}ake},
|
kpeter@801
|
66 |
url = {http://www.cmake.org/}
|
kpeter@790
|
67 |
}
|
kpeter@790
|
68 |
|
kpeter@790
|
69 |
@misc{doxygen,
|
kpeter@790
|
70 |
key = {Doxygen},
|
kpeter@790
|
71 |
title = {{Doxygen} -- {S}ource code documentation generator
|
kpeter@790
|
72 |
tool},
|
kpeter@801
|
73 |
url = {http://www.doxygen.org/}
|
kpeter@790
|
74 |
}
|
kpeter@790
|
75 |
|
kpeter@790
|
76 |
|
kpeter@790
|
77 |
%%%%% LP/MIP libraries %%%%%
|
kpeter@790
|
78 |
|
kpeter@790
|
79 |
@misc{glpk,
|
kpeter@790
|
80 |
key = {GLPK},
|
kpeter@790
|
81 |
title = {{GLPK} -- {GNU} {L}inear {P}rogramming {K}it},
|
kpeter@801
|
82 |
url = {http://www.gnu.org/software/glpk/}
|
kpeter@790
|
83 |
}
|
kpeter@790
|
84 |
|
kpeter@790
|
85 |
@misc{clp,
|
kpeter@790
|
86 |
key = {Clp},
|
kpeter@790
|
87 |
title = {{Clp} -- {Coin-Or} {L}inear {P}rogramming},
|
kpeter@801
|
88 |
url = {http://projects.coin-or.org/Clp/}
|
kpeter@790
|
89 |
}
|
kpeter@790
|
90 |
|
kpeter@790
|
91 |
@misc{cbc,
|
kpeter@790
|
92 |
key = {Cbc},
|
kpeter@790
|
93 |
title = {{Cbc} -- {Coin-Or} {B}ranch and {C}ut},
|
kpeter@801
|
94 |
url = {http://projects.coin-or.org/Cbc/}
|
kpeter@790
|
95 |
}
|
kpeter@790
|
96 |
|
kpeter@790
|
97 |
@misc{cplex,
|
kpeter@790
|
98 |
key = {CPLEX},
|
kpeter@790
|
99 |
title = {{ILOG} {CPLEX}},
|
kpeter@801
|
100 |
url = {http://www.ilog.com/}
|
kpeter@790
|
101 |
}
|
kpeter@790
|
102 |
|
kpeter@790
|
103 |
@misc{soplex,
|
kpeter@790
|
104 |
key = {SoPlex},
|
kpeter@790
|
105 |
title = {{SoPlex} -- {T}he {S}equential {O}bject-{O}riented
|
kpeter@790
|
106 |
{S}implex},
|
kpeter@801
|
107 |
url = {http://soplex.zib.de/}
|
kpeter@790
|
108 |
}
|
kpeter@790
|
109 |
|
kpeter@790
|
110 |
|
kpeter@790
|
111 |
%%%%% General books %%%%%
|
kpeter@790
|
112 |
|
kpeter@790
|
113 |
@book{amo93networkflows,
|
kpeter@790
|
114 |
author = {Ravindra K. Ahuja and Thomas L. Magnanti and James
|
kpeter@790
|
115 |
B. Orlin},
|
kpeter@790
|
116 |
title = {Network Flows: Theory, Algorithms, and Applications},
|
kpeter@790
|
117 |
publisher = {Prentice-Hall, Inc.},
|
kpeter@790
|
118 |
year = 1993,
|
kpeter@790
|
119 |
month = feb,
|
kpeter@790
|
120 |
isbn = {978-0136175490}
|
kpeter@790
|
121 |
}
|
kpeter@790
|
122 |
|
kpeter@790
|
123 |
@book{schrijver03combinatorial,
|
kpeter@790
|
124 |
author = {Alexander Schrijver},
|
kpeter@790
|
125 |
title = {Combinatorial Optimization: Polyhedra and Efficiency},
|
kpeter@790
|
126 |
publisher = {Springer-Verlag},
|
kpeter@790
|
127 |
year = 2003,
|
kpeter@790
|
128 |
isbn = {978-3540443896}
|
kpeter@790
|
129 |
}
|
kpeter@790
|
130 |
|
kpeter@790
|
131 |
@book{clrs01algorithms,
|
kpeter@790
|
132 |
author = {Thomas H. Cormen and Charles E. Leiserson and Ronald
|
kpeter@790
|
133 |
L. Rivest and Clifford Stein},
|
kpeter@790
|
134 |
title = {Introduction to Algorithms},
|
kpeter@790
|
135 |
publisher = {The MIT Press},
|
kpeter@790
|
136 |
year = 2001,
|
kpeter@790
|
137 |
edition = {2nd}
|
kpeter@790
|
138 |
}
|
kpeter@790
|
139 |
|
kpeter@790
|
140 |
@book{stroustrup00cpp,
|
kpeter@790
|
141 |
author = {Bjarne Stroustrup},
|
kpeter@790
|
142 |
title = {The C++ Programming Language},
|
kpeter@790
|
143 |
edition = {3rd},
|
kpeter@790
|
144 |
publisher = {Addison-Wesley Professional},
|
kpeter@790
|
145 |
isbn = 0201700735,
|
kpeter@790
|
146 |
month = {February},
|
kpeter@790
|
147 |
year = 2000
|
kpeter@790
|
148 |
}
|
kpeter@790
|
149 |
|
kpeter@790
|
150 |
|
kpeter@790
|
151 |
%%%%% Maximum flow algorithms %%%%%
|
kpeter@790
|
152 |
|
kpeter@790
|
153 |
@inproceedings{goldberg86newapproach,
|
kpeter@790
|
154 |
author = {Andrew V. Goldberg and Robert E. Tarjan},
|
kpeter@790
|
155 |
title = {A new approach to the maximum flow problem},
|
kpeter@790
|
156 |
booktitle = {STOC '86: Proceedings of the Eighteenth Annual ACM
|
kpeter@790
|
157 |
Symposium on Theory of Computing},
|
kpeter@790
|
158 |
year = 1986,
|
kpeter@790
|
159 |
publisher = {ACM Press},
|
kpeter@790
|
160 |
address = {New York, NY},
|
kpeter@790
|
161 |
pages = {136-146}
|
kpeter@790
|
162 |
}
|
kpeter@790
|
163 |
|
kpeter@790
|
164 |
@article{dinic70algorithm,
|
kpeter@790
|
165 |
author = {E. A. Dinic},
|
kpeter@790
|
166 |
title = {Algorithm for solution of a problem of maximum flow
|
kpeter@790
|
167 |
in a network with power estimation},
|
kpeter@790
|
168 |
journal = {Soviet Math. Doklady},
|
kpeter@790
|
169 |
year = 1970,
|
kpeter@790
|
170 |
volume = 11,
|
kpeter@790
|
171 |
pages = {1277-1280}
|
kpeter@790
|
172 |
}
|
kpeter@790
|
173 |
|
kpeter@790
|
174 |
@article{goldberg08partial,
|
kpeter@790
|
175 |
author = {Andrew V. Goldberg},
|
kpeter@790
|
176 |
title = {The Partial Augment-Relabel Algorithm for the
|
kpeter@790
|
177 |
Maximum Flow Problem},
|
kpeter@790
|
178 |
journal = {16th Annual European Symposium on Algorithms},
|
kpeter@790
|
179 |
year = 2008,
|
kpeter@790
|
180 |
pages = {466-477}
|
kpeter@790
|
181 |
}
|
kpeter@790
|
182 |
|
kpeter@790
|
183 |
@article{sleator83dynamic,
|
kpeter@790
|
184 |
author = {Daniel D. Sleator and Robert E. Tarjan},
|
kpeter@790
|
185 |
title = {A data structure for dynamic trees},
|
kpeter@790
|
186 |
journal = {Journal of Computer and System Sciences},
|
kpeter@790
|
187 |
year = 1983,
|
kpeter@790
|
188 |
volume = 26,
|
kpeter@790
|
189 |
number = 3,
|
kpeter@790
|
190 |
pages = {362-391}
|
kpeter@790
|
191 |
}
|
kpeter@790
|
192 |
|
kpeter@790
|
193 |
|
kpeter@790
|
194 |
%%%%% Minimum mean cycle algorithms %%%%%
|
kpeter@790
|
195 |
|
kpeter@790
|
196 |
@article{karp78characterization,
|
kpeter@790
|
197 |
author = {Richard M. Karp},
|
kpeter@790
|
198 |
title = {A characterization of the minimum cycle mean in a
|
kpeter@790
|
199 |
digraph},
|
kpeter@790
|
200 |
journal = {Discrete Math.},
|
kpeter@790
|
201 |
year = 1978,
|
kpeter@790
|
202 |
volume = 23,
|
kpeter@790
|
203 |
pages = {309-311}
|
kpeter@790
|
204 |
}
|
kpeter@790
|
205 |
|
kpeter@790
|
206 |
@article{dasdan98minmeancycle,
|
kpeter@790
|
207 |
author = {Ali Dasdan and Rajesh K. Gupta},
|
kpeter@790
|
208 |
title = {Faster Maximum and Minimum Mean Cycle Alogrithms for
|
kpeter@790
|
209 |
System Performance Analysis},
|
kpeter@790
|
210 |
journal = {IEEE Transactions on Computer-Aided Design of
|
kpeter@790
|
211 |
Integrated Circuits and Systems},
|
kpeter@790
|
212 |
year = 1998,
|
kpeter@790
|
213 |
volume = 17,
|
kpeter@790
|
214 |
number = 10,
|
kpeter@790
|
215 |
pages = {889-899}
|
kpeter@790
|
216 |
}
|
kpeter@790
|
217 |
|
kpeter@790
|
218 |
|
kpeter@790
|
219 |
%%%%% Minimum cost flow algorithms %%%%%
|
kpeter@790
|
220 |
|
kpeter@790
|
221 |
@article{klein67primal,
|
kpeter@790
|
222 |
author = {Morton Klein},
|
kpeter@790
|
223 |
title = {A primal method for minimal cost flows with
|
kpeter@790
|
224 |
applications to the assignment and transportation
|
kpeter@790
|
225 |
problems},
|
kpeter@790
|
226 |
journal = {Management Science},
|
kpeter@790
|
227 |
year = 1967,
|
kpeter@790
|
228 |
volume = 14,
|
kpeter@790
|
229 |
pages = {205-220}
|
kpeter@790
|
230 |
}
|
kpeter@790
|
231 |
|
kpeter@790
|
232 |
@inproceedings{goldberg88cyclecanceling,
|
kpeter@790
|
233 |
author = {Andrew V. Goldberg and Robert E. Tarjan},
|
kpeter@790
|
234 |
title = {Finding minimum-cost circulations by canceling
|
kpeter@790
|
235 |
negative cycles},
|
kpeter@790
|
236 |
booktitle = {STOC '88: Proceedings of the Twentieth Annual ACM
|
kpeter@790
|
237 |
Symposium on Theory of Computing},
|
kpeter@790
|
238 |
year = 1988,
|
kpeter@790
|
239 |
publisher = {ACM Press},
|
kpeter@790
|
240 |
address = {New York, NY},
|
kpeter@790
|
241 |
pages = {388-397}
|
kpeter@790
|
242 |
}
|
kpeter@790
|
243 |
|
kpeter@790
|
244 |
@article{edmondskarp72theoretical,
|
kpeter@790
|
245 |
author = {Jack Edmonds and Richard M. Karp},
|
kpeter@790
|
246 |
title = {Theoretical improvements in algorithmic efficiency
|
kpeter@790
|
247 |
for network flow problems},
|
kpeter@790
|
248 |
journal = {Journal of the ACM},
|
kpeter@790
|
249 |
year = 1972,
|
kpeter@790
|
250 |
volume = 19,
|
kpeter@790
|
251 |
number = 2,
|
kpeter@790
|
252 |
pages = {248-264}
|
kpeter@790
|
253 |
}
|
kpeter@790
|
254 |
|
kpeter@790
|
255 |
@inproceedings{goldberg87approximation,
|
kpeter@790
|
256 |
author = {Andrew V. Goldberg and Robert E. Tarjan},
|
kpeter@790
|
257 |
title = {Solving minimum-cost flow problems by successive
|
kpeter@790
|
258 |
approximation},
|
kpeter@790
|
259 |
booktitle = {STOC '87: Proceedings of the Nineteenth Annual ACM
|
kpeter@790
|
260 |
Symposium on Theory of Computing},
|
kpeter@790
|
261 |
year = 1987,
|
kpeter@790
|
262 |
publisher = {ACM Press},
|
kpeter@790
|
263 |
address = {New York, NY},
|
kpeter@790
|
264 |
pages = {7-18}
|
kpeter@790
|
265 |
}
|
kpeter@790
|
266 |
|
kpeter@790
|
267 |
@article{goldberg90finding,
|
kpeter@790
|
268 |
author = {Andrew V. Goldberg and Robert E. Tarjan},
|
kpeter@790
|
269 |
title = {Finding Minimum-Cost Circulations by Successive
|
kpeter@790
|
270 |
Approximation},
|
kpeter@790
|
271 |
journal = {Mathematics of Operations Research},
|
kpeter@790
|
272 |
year = 1990,
|
kpeter@790
|
273 |
volume = 15,
|
kpeter@790
|
274 |
number = 3,
|
kpeter@790
|
275 |
pages = {430-466}
|
kpeter@790
|
276 |
}
|
kpeter@790
|
277 |
|
kpeter@790
|
278 |
@article{goldberg97efficient,
|
kpeter@790
|
279 |
author = {Andrew V. Goldberg},
|
kpeter@790
|
280 |
title = {An Efficient Implementation of a Scaling
|
kpeter@790
|
281 |
Minimum-Cost Flow Algorithm},
|
kpeter@790
|
282 |
journal = {Journal of Algorithms},
|
kpeter@790
|
283 |
year = 1997,
|
kpeter@790
|
284 |
volume = 22,
|
kpeter@790
|
285 |
number = 1,
|
kpeter@790
|
286 |
pages = {1-29}
|
kpeter@790
|
287 |
}
|
kpeter@790
|
288 |
|
kpeter@790
|
289 |
@article{bunnagel98efficient,
|
kpeter@790
|
290 |
author = {Ursula B{\"u}nnagel and Bernhard Korte and Jens
|
kpeter@790
|
291 |
Vygen},
|
kpeter@790
|
292 |
title = {Efficient implementation of the {G}oldberg-{T}arjan
|
kpeter@790
|
293 |
minimum-cost flow algorithm},
|
kpeter@790
|
294 |
journal = {Optimization Methods and Software},
|
kpeter@790
|
295 |
year = 1998,
|
kpeter@790
|
296 |
volume = 10,
|
kpeter@790
|
297 |
pages = {157-174}
|
kpeter@790
|
298 |
}
|
kpeter@790
|
299 |
|
kpeter@790
|
300 |
@mastersthesis{kellyoneill91netsimplex,
|
kpeter@790
|
301 |
author = {Damian J. Kelly and Garrett M. O'Neill},
|
kpeter@790
|
302 |
title = {The Minimum Cost Flow Problem and The Network
|
kpeter@790
|
303 |
Simplex Method},
|
kpeter@790
|
304 |
school = {University College},
|
kpeter@790
|
305 |
address = {Dublin, Ireland},
|
kpeter@790
|
306 |
year = 1991,
|
kpeter@790
|
307 |
month = sep,
|
kpeter@790
|
308 |
}
|
kpeter@790
|
309 |
|
kpeter@790
|
310 |
@techreport{lobel96networksimplex,
|
kpeter@790
|
311 |
author = {Andreas L{\"o}bel},
|
kpeter@790
|
312 |
title = {Solving large-scale real-world minimum-cost flow
|
kpeter@790
|
313 |
problems by a network simplex method},
|
kpeter@790
|
314 |
institution = {Konrad-Zuse-Zentrum fur Informationstechnik Berlin
|
kpeter@790
|
315 |
({ZIB})},
|
kpeter@790
|
316 |
address = {Berlin, Germany},
|
kpeter@790
|
317 |
year = 1996,
|
kpeter@790
|
318 |
number = {SC 96-7}
|
kpeter@790
|
319 |
}
|
kpeter@790
|
320 |
|
kpeter@790
|
321 |
@article{frangioni06computational,
|
kpeter@790
|
322 |
author = {Antonio Frangioni and Antonio Manca},
|
kpeter@790
|
323 |
title = {A Computational Study of Cost Reoptimization for
|
kpeter@790
|
324 |
Min-Cost Flow Problems},
|
kpeter@790
|
325 |
journal = {INFORMS Journal On Computing},
|
kpeter@790
|
326 |
year = 2006,
|
kpeter@790
|
327 |
volume = 18,
|
kpeter@790
|
328 |
number = 1,
|
kpeter@790
|
329 |
pages = {61-70}
|
kpeter@790
|
330 |
}
|