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