COIN-OR::LEMON - Graph Library

source: lemon-1.2/doc/references.bib @ 743:94ef0a5c0005

Last change on this file since 743:94ef0a5c0005 was 743:94ef0a5c0005, checked in by Peter Kovacs <kpeter@…>, 10 years ago

Add bib->dox converter and initial references.bib (#184)

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