COIN-OR::LEMON - Graph Library

Ticket #184: references.bib

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