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