COIN-OR::LEMON - Graph Library

source: lemon-1.2/doc/references.bib @ 754:2de0fc630899

Last change on this file since 754:2de0fc630899 was 754:2de0fc630899, checked in by Peter Kovacs <kpeter@…>, 10 years ago

Handle url fields in bib2dox.py (#184)
and modify the bibtex file using url fields.

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