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