1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/doc/references.bib Sat Sep 26 10:15:49 2009 +0200
1.3 @@ -0,0 +1,341 @@
1.4 +%%%%% Defining LEMON %%%%%
1.5 +
1.6 +@misc{lemon,
1.7 + key = {LEMON},
1.8 + title = {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
1.9 + {O}ptimization in {N}etworks},
1.10 + howpublished = {\url{http://lemon.cs.elte.hu/}},
1.11 + year = 2009
1.12 +}
1.13 +
1.14 +@misc{egres,
1.15 + key = {EGRES},
1.16 + title = {{EGRES} -- {E}gerv{\'a}ry {R}esearch {G}roup on
1.17 + {C}ombinatorial {O}ptimization},
1.18 + howpublished = {\url{http://www.cs.elte.hu/egres/}},
1.19 + year = 2009
1.20 +}
1.21 +
1.22 +@misc{coinor,
1.23 + key = {COIN-OR},
1.24 + title = {{COIN-OR} -- {C}omputational {I}nfrastructure for
1.25 + {O}perations {R}esearch},
1.26 + howpublished = {\url{http://www.coin-or.org/}},
1.27 + year = 2009
1.28 +}
1.29 +
1.30 +
1.31 +%%%%% Other libraries %%%%%%
1.32 +
1.33 +@misc{boost,
1.34 + key = {Boost},
1.35 + title = {{B}oost {C++} {L}ibraries},
1.36 + howpublished = {\url{http://www.boost.org/}},
1.37 + year = 2009
1.38 +}
1.39 +
1.40 +@book{bglbook,
1.41 + author = {Jeremy G. Siek and Lee-Quan Lee and Andrew
1.42 + Lumsdaine},
1.43 + title = {The Boost Graph Library: User Guide and Reference
1.44 + Manual},
1.45 + publisher = {Addison-Wesley},
1.46 + year = 2002
1.47 +}
1.48 +
1.49 +@misc{leda,
1.50 + key = {LEDA},
1.51 + title = {{LEDA} -- {L}ibrary of {E}fficient {D}ata {T}ypes and
1.52 + {A}lgorithms},
1.53 + howpublished = {\url{http://www.algorithmic-solutions.com/}},
1.54 + year = 2009
1.55 +}
1.56 +
1.57 +@book{ledabook,
1.58 + author = {Kurt Mehlhorn and Stefan N{\"a}her},
1.59 + title = {{LEDA}: {A} platform for combinatorial and geometric
1.60 + computing},
1.61 + isbn = {0-521-56329-1},
1.62 + publisher = {Cambridge University Press},
1.63 + address = {New York, NY, USA},
1.64 + year = 1999
1.65 +}
1.66 +
1.67 +
1.68 +%%%%% Tools that LEMON depends on %%%%%
1.69 +
1.70 +@misc{cmake,
1.71 + key = {CMake},
1.72 + title = {{CMake} -- {C}ross {P}latform {M}ake},
1.73 + howpublished = {\url{http://www.cmake.org/}},
1.74 + year = 2009
1.75 +}
1.76 +
1.77 +@misc{doxygen,
1.78 + key = {Doxygen},
1.79 + title = {{Doxygen} -- {S}ource code documentation generator
1.80 + tool},
1.81 + howpublished = {\url{http://www.doxygen.org/}},
1.82 + year = 2009
1.83 +}
1.84 +
1.85 +
1.86 +%%%%% LP/MIP libraries %%%%%
1.87 +
1.88 +@misc{glpk,
1.89 + key = {GLPK},
1.90 + title = {{GLPK} -- {GNU} {L}inear {P}rogramming {K}it},
1.91 + howpublished = {\url{http://www.gnu.org/software/glpk/}},
1.92 + year = 2009
1.93 +}
1.94 +
1.95 +@misc{clp,
1.96 + key = {Clp},
1.97 + title = {{Clp} -- {Coin-Or} {L}inear {P}rogramming},
1.98 + howpublished = {\url{http://projects.coin-or.org/Clp/}},
1.99 + year = 2009
1.100 +}
1.101 +
1.102 +@misc{cbc,
1.103 + key = {Cbc},
1.104 + title = {{Cbc} -- {Coin-Or} {B}ranch and {C}ut},
1.105 + howpublished = {\url{http://projects.coin-or.org/Cbc/}},
1.106 + year = 2009
1.107 +}
1.108 +
1.109 +@misc{cplex,
1.110 + key = {CPLEX},
1.111 + title = {{ILOG} {CPLEX}},
1.112 + howpublished = {\url{http://www.ilog.com/}},
1.113 + year = 2009
1.114 +}
1.115 +
1.116 +@misc{soplex,
1.117 + key = {SoPlex},
1.118 + title = {{SoPlex} -- {T}he {S}equential {O}bject-{O}riented
1.119 + {S}implex},
1.120 + howpublished = {\url{http://soplex.zib.de/}},
1.121 + year = 2009
1.122 +}
1.123 +
1.124 +
1.125 +%%%%% General books %%%%%
1.126 +
1.127 +@book{amo93networkflows,
1.128 + author = {Ravindra K. Ahuja and Thomas L. Magnanti and James
1.129 + B. Orlin},
1.130 + title = {Network Flows: Theory, Algorithms, and Applications},
1.131 + publisher = {Prentice-Hall, Inc.},
1.132 + year = 1993,
1.133 + month = feb,
1.134 + isbn = {978-0136175490}
1.135 +}
1.136 +
1.137 +@book{schrijver03combinatorial,
1.138 + author = {Alexander Schrijver},
1.139 + title = {Combinatorial Optimization: Polyhedra and Efficiency},
1.140 + publisher = {Springer-Verlag},
1.141 + year = 2003,
1.142 + isbn = {978-3540443896}
1.143 +}
1.144 +
1.145 +@book{clrs01algorithms,
1.146 + author = {Thomas H. Cormen and Charles E. Leiserson and Ronald
1.147 + L. Rivest and Clifford Stein},
1.148 + title = {Introduction to Algorithms},
1.149 + publisher = {The MIT Press},
1.150 + year = 2001,
1.151 + edition = {2nd}
1.152 +}
1.153 +
1.154 +@book{stroustrup00cpp,
1.155 + author = {Bjarne Stroustrup},
1.156 + title = {The C++ Programming Language},
1.157 + edition = {3rd},
1.158 + publisher = {Addison-Wesley Professional},
1.159 + isbn = 0201700735,
1.160 + month = {February},
1.161 + year = 2000
1.162 +}
1.163 +
1.164 +
1.165 +%%%%% Maximum flow algorithms %%%%%
1.166 +
1.167 +@inproceedings{goldberg86newapproach,
1.168 + author = {Andrew V. Goldberg and Robert E. Tarjan},
1.169 + title = {A new approach to the maximum flow problem},
1.170 + booktitle = {STOC '86: Proceedings of the Eighteenth Annual ACM
1.171 + Symposium on Theory of Computing},
1.172 + year = 1986,
1.173 + publisher = {ACM Press},
1.174 + address = {New York, NY},
1.175 + pages = {136-146}
1.176 +}
1.177 +
1.178 +@article{dinic70algorithm,
1.179 + author = {E. A. Dinic},
1.180 + title = {Algorithm for solution of a problem of maximum flow
1.181 + in a network with power estimation},
1.182 + journal = {Soviet Math. Doklady},
1.183 + year = 1970,
1.184 + volume = 11,
1.185 + pages = {1277-1280}
1.186 +}
1.187 +
1.188 +@article{goldberg08partial,
1.189 + author = {Andrew V. Goldberg},
1.190 + title = {The Partial Augment-Relabel Algorithm for the
1.191 + Maximum Flow Problem},
1.192 + journal = {16th Annual European Symposium on Algorithms},
1.193 + year = 2008,
1.194 + pages = {466-477}
1.195 +}
1.196 +
1.197 +@article{sleator83dynamic,
1.198 + author = {Daniel D. Sleator and Robert E. Tarjan},
1.199 + title = {A data structure for dynamic trees},
1.200 + journal = {Journal of Computer and System Sciences},
1.201 + year = 1983,
1.202 + volume = 26,
1.203 + number = 3,
1.204 + pages = {362-391}
1.205 +}
1.206 +
1.207 +
1.208 +%%%%% Minimum mean cycle algorithms %%%%%
1.209 +
1.210 +@article{karp78characterization,
1.211 + author = {Richard M. Karp},
1.212 + title = {A characterization of the minimum cycle mean in a
1.213 + digraph},
1.214 + journal = {Discrete Math.},
1.215 + year = 1978,
1.216 + volume = 23,
1.217 + pages = {309-311}
1.218 +}
1.219 +
1.220 +@article{dasdan98minmeancycle,
1.221 + author = {Ali Dasdan and Rajesh K. Gupta},
1.222 + title = {Faster Maximum and Minimum Mean Cycle Alogrithms for
1.223 + System Performance Analysis},
1.224 + journal = {IEEE Transactions on Computer-Aided Design of
1.225 + Integrated Circuits and Systems},
1.226 + year = 1998,
1.227 + volume = 17,
1.228 + number = 10,
1.229 + pages = {889-899}
1.230 +}
1.231 +
1.232 +
1.233 +%%%%% Minimum cost flow algorithms %%%%%
1.234 +
1.235 +@article{klein67primal,
1.236 + author = {Morton Klein},
1.237 + title = {A primal method for minimal cost flows with
1.238 + applications to the assignment and transportation
1.239 + problems},
1.240 + journal = {Management Science},
1.241 + year = 1967,
1.242 + volume = 14,
1.243 + pages = {205-220}
1.244 +}
1.245 +
1.246 +@inproceedings{goldberg88cyclecanceling,
1.247 + author = {Andrew V. Goldberg and Robert E. Tarjan},
1.248 + title = {Finding minimum-cost circulations by canceling
1.249 + negative cycles},
1.250 + booktitle = {STOC '88: Proceedings of the Twentieth Annual ACM
1.251 + Symposium on Theory of Computing},
1.252 + year = 1988,
1.253 + publisher = {ACM Press},
1.254 + address = {New York, NY},
1.255 + pages = {388-397}
1.256 +}
1.257 +
1.258 +@article{edmondskarp72theoretical,
1.259 + author = {Jack Edmonds and Richard M. Karp},
1.260 + title = {Theoretical improvements in algorithmic efficiency
1.261 + for network flow problems},
1.262 + journal = {Journal of the ACM},
1.263 + year = 1972,
1.264 + volume = 19,
1.265 + number = 2,
1.266 + pages = {248-264}
1.267 +}
1.268 +
1.269 +@inproceedings{goldberg87approximation,
1.270 + author = {Andrew V. Goldberg and Robert E. Tarjan},
1.271 + title = {Solving minimum-cost flow problems by successive
1.272 + approximation},
1.273 + booktitle = {STOC '87: Proceedings of the Nineteenth Annual ACM
1.274 + Symposium on Theory of Computing},
1.275 + year = 1987,
1.276 + publisher = {ACM Press},
1.277 + address = {New York, NY},
1.278 + pages = {7-18}
1.279 +}
1.280 +
1.281 +@article{goldberg90finding,
1.282 + author = {Andrew V. Goldberg and Robert E. Tarjan},
1.283 + title = {Finding Minimum-Cost Circulations by Successive
1.284 + Approximation},
1.285 + journal = {Mathematics of Operations Research},
1.286 + year = 1990,
1.287 + volume = 15,
1.288 + number = 3,
1.289 + pages = {430-466}
1.290 +}
1.291 +
1.292 +@article{goldberg97efficient,
1.293 + author = {Andrew V. Goldberg},
1.294 + title = {An Efficient Implementation of a Scaling
1.295 + Minimum-Cost Flow Algorithm},
1.296 + journal = {Journal of Algorithms},
1.297 + year = 1997,
1.298 + volume = 22,
1.299 + number = 1,
1.300 + pages = {1-29}
1.301 +}
1.302 +
1.303 +@article{bunnagel98efficient,
1.304 + author = {Ursula B{\"u}nnagel and Bernhard Korte and Jens
1.305 + Vygen},
1.306 + title = {Efficient implementation of the {G}oldberg-{T}arjan
1.307 + minimum-cost flow algorithm},
1.308 + journal = {Optimization Methods and Software},
1.309 + year = 1998,
1.310 + volume = 10,
1.311 + pages = {157-174}
1.312 +}
1.313 +
1.314 +@mastersthesis{kellyoneill91netsimplex,
1.315 + author = {Damian J. Kelly and Garrett M. O'Neill},
1.316 + title = {The Minimum Cost Flow Problem and The Network
1.317 + Simplex Method},
1.318 + school = {University College},
1.319 + address = {Dublin, Ireland},
1.320 + year = 1991,
1.321 + month = sep,
1.322 +}
1.323 +
1.324 +@techreport{lobel96networksimplex,
1.325 + author = {Andreas L{\"o}bel},
1.326 + title = {Solving large-scale real-world minimum-cost flow
1.327 + problems by a network simplex method},
1.328 + institution = {Konrad-Zuse-Zentrum fur Informationstechnik Berlin
1.329 + ({ZIB})},
1.330 + address = {Berlin, Germany},
1.331 + year = 1996,
1.332 + number = {SC 96-7}
1.333 +}
1.334 +
1.335 +@article{frangioni06computational,
1.336 + author = {Antonio Frangioni and Antonio Manca},
1.337 + title = {A Computational Study of Cost Reoptimization for
1.338 + Min-Cost Flow Problems},
1.339 + journal = {INFORMS Journal On Computing},
1.340 + year = 2006,
1.341 + volume = 18,
1.342 + number = 1,
1.343 + pages = {61-70}
1.344 +}