doc/references.bib
author Daniel Poroszkai <poroszd@inf.elte.hu>
Sun, 05 Feb 2012 00:04:44 +0100
changeset 1197 374a9519986b
parent 999 c279b19abc62
child 1219 4f9a45a6d6f0
permissions -rw-r--r--
Update LGF reader to work with typesafe bipartite node sets (#69)
kpeter@790
     1
%%%%% Defining LEMON %%%%%
kpeter@790
     2
kpeter@790
     3
@misc{lemon,
kpeter@790
     4
  key =          {LEMON},
kpeter@790
     5
  title =        {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
kpeter@790
     6
                  {O}ptimization in {N}etworks},
kpeter@1164
     7
  howpublished = {\url{http://lemon.cs.elte.hu/}}
kpeter@790
     8
}
kpeter@790
     9
kpeter@790
    10
@misc{egres,
kpeter@790
    11
  key =          {EGRES},
kpeter@790
    12
  title =        {{EGRES} -- {E}gerv{\'a}ry {R}esearch {G}roup on
kpeter@790
    13
                  {C}ombinatorial {O}ptimization},
kpeter@801
    14
  url =          {http://www.cs.elte.hu/egres/}
kpeter@790
    15
}
kpeter@790
    16
kpeter@790
    17
@misc{coinor,
kpeter@790
    18
  key =          {COIN-OR},
kpeter@790
    19
  title =        {{COIN-OR} -- {C}omputational {I}nfrastructure for
kpeter@790
    20
                  {O}perations {R}esearch},
kpeter@801
    21
  url =          {http://www.coin-or.org/}
kpeter@790
    22
}
kpeter@790
    23
kpeter@790
    24
kpeter@790
    25
%%%%% Other libraries %%%%%%
kpeter@790
    26
kpeter@790
    27
@misc{boost,
kpeter@790
    28
  key =          {Boost},
kpeter@790
    29
  title =        {{B}oost {C++} {L}ibraries},
kpeter@801
    30
  url =          {http://www.boost.org/}
kpeter@790
    31
}
kpeter@790
    32
kpeter@790
    33
@book{bglbook,
kpeter@790
    34
  author =       {Jeremy G. Siek and Lee-Quan Lee and Andrew
kpeter@790
    35
                  Lumsdaine},
kpeter@790
    36
  title =        {The Boost Graph Library: User Guide and Reference
kpeter@790
    37
                  Manual},
kpeter@790
    38
  publisher =    {Addison-Wesley},
kpeter@790
    39
  year =         2002
kpeter@790
    40
}
kpeter@790
    41
kpeter@790
    42
@misc{leda,
kpeter@790
    43
  key =          {LEDA},
kpeter@790
    44
  title =        {{LEDA} -- {L}ibrary of {E}fficient {D}ata {T}ypes and
kpeter@790
    45
                  {A}lgorithms},
kpeter@801
    46
  url =          {http://www.algorithmic-solutions.com/}
kpeter@790
    47
}
kpeter@790
    48
kpeter@790
    49
@book{ledabook,
kpeter@790
    50
  author =       {Kurt Mehlhorn and Stefan N{\"a}her},
kpeter@790
    51
  title =        {{LEDA}: {A} platform for combinatorial and geometric
kpeter@790
    52
                  computing},
kpeter@790
    53
  isbn =         {0-521-56329-1},
kpeter@790
    54
  publisher =    {Cambridge University Press},
kpeter@790
    55
  address =      {New York, NY, USA},
kpeter@790
    56
  year =         1999
kpeter@790
    57
}
kpeter@790
    58
kpeter@790
    59
kpeter@790
    60
%%%%% Tools that LEMON depends on %%%%%
kpeter@790
    61
kpeter@790
    62
@misc{cmake,
kpeter@790
    63
  key =          {CMake},
kpeter@790
    64
  title =        {{CMake} -- {C}ross {P}latform {M}ake},
kpeter@801
    65
  url =          {http://www.cmake.org/}
kpeter@790
    66
}
kpeter@790
    67
kpeter@790
    68
@misc{doxygen,
kpeter@790
    69
  key =          {Doxygen},
kpeter@790
    70
  title =        {{Doxygen} -- {S}ource code documentation generator
kpeter@790
    71
                  tool},
kpeter@801
    72
  url =          {http://www.doxygen.org/}
kpeter@790
    73
}
kpeter@790
    74
kpeter@790
    75
kpeter@790
    76
%%%%% LP/MIP libraries %%%%%
kpeter@790
    77
kpeter@790
    78
@misc{glpk,
kpeter@790
    79
  key =          {GLPK},
kpeter@790
    80
  title =        {{GLPK} -- {GNU} {L}inear {P}rogramming {K}it},
kpeter@801
    81
  url =          {http://www.gnu.org/software/glpk/}
kpeter@790
    82
}
kpeter@790
    83
kpeter@790
    84
@misc{clp,
kpeter@790
    85
  key =          {Clp},
kpeter@790
    86
  title =        {{Clp} -- {Coin-Or} {L}inear {P}rogramming},
kpeter@801
    87
  url =          {http://projects.coin-or.org/Clp/}
kpeter@790
    88
}
kpeter@790
    89
kpeter@790
    90
@misc{cbc,
kpeter@790
    91
  key =          {Cbc},
kpeter@790
    92
  title =        {{Cbc} -- {Coin-Or} {B}ranch and {C}ut},
kpeter@801
    93
  url =          {http://projects.coin-or.org/Cbc/}
kpeter@790
    94
}
kpeter@790
    95
kpeter@790
    96
@misc{cplex,
kpeter@790
    97
  key =          {CPLEX},
kpeter@790
    98
  title =        {{ILOG} {CPLEX}},
kpeter@801
    99
  url =          {http://www.ilog.com/}
kpeter@790
   100
}
kpeter@790
   101
kpeter@790
   102
@misc{soplex,
kpeter@790
   103
  key =          {SoPlex},
kpeter@790
   104
  title =        {{SoPlex} -- {T}he {S}equential {O}bject-{O}riented
kpeter@790
   105
                  {S}implex},
kpeter@801
   106
  url =          {http://soplex.zib.de/}
kpeter@790
   107
}
kpeter@790
   108
kpeter@790
   109
kpeter@790
   110
%%%%% General books %%%%%
kpeter@790
   111
kpeter@790
   112
@book{amo93networkflows,
kpeter@790
   113
  author =       {Ravindra K. Ahuja and Thomas L. Magnanti and James
kpeter@790
   114
                  B. Orlin},
kpeter@790
   115
  title =        {Network Flows: Theory, Algorithms, and Applications},
kpeter@790
   116
  publisher =    {Prentice-Hall, Inc.},
kpeter@790
   117
  year =         1993,
kpeter@790
   118
  month =        feb,
kpeter@790
   119
  isbn =         {978-0136175490}
kpeter@790
   120
}
kpeter@790
   121
kpeter@790
   122
@book{schrijver03combinatorial,
kpeter@790
   123
  author =       {Alexander Schrijver},
kpeter@790
   124
  title =        {Combinatorial Optimization: Polyhedra and Efficiency},
kpeter@790
   125
  publisher =    {Springer-Verlag},
kpeter@790
   126
  year =         2003,
kpeter@790
   127
  isbn =         {978-3540443896}
kpeter@790
   128
}
kpeter@790
   129
kpeter@790
   130
@book{clrs01algorithms,
kpeter@790
   131
  author =       {Thomas H. Cormen and Charles E. Leiserson and Ronald
kpeter@790
   132
                  L. Rivest and Clifford Stein},
kpeter@790
   133
  title =        {Introduction to Algorithms},
kpeter@790
   134
  publisher =    {The MIT Press},
kpeter@790
   135
  year =         2001,
kpeter@790
   136
  edition =      {2nd}
kpeter@790
   137
}
kpeter@790
   138
kpeter@790
   139
@book{stroustrup00cpp,
kpeter@790
   140
  author =       {Bjarne Stroustrup},
kpeter@790
   141
  title =        {The C++ Programming Language},
kpeter@790
   142
  edition =      {3rd},
kpeter@790
   143
  publisher =    {Addison-Wesley Professional},
kpeter@790
   144
  isbn =         0201700735,
kpeter@790
   145
  month =        {February},
kpeter@790
   146
  year =         2000
kpeter@790
   147
}
kpeter@790
   148
kpeter@790
   149
kpeter@790
   150
%%%%% Maximum flow algorithms %%%%%
kpeter@790
   151
kpeter@802
   152
@article{edmondskarp72theoretical,
kpeter@802
   153
  author =       {Jack Edmonds and Richard M. Karp},
kpeter@802
   154
  title =        {Theoretical improvements in algorithmic efficiency
kpeter@802
   155
                  for network flow problems},
kpeter@802
   156
  journal =      {Journal of the ACM},
kpeter@802
   157
  year =         1972,
kpeter@802
   158
  volume =       19,
kpeter@802
   159
  number =       2,
kpeter@802
   160
  pages =        {248-264}
kpeter@802
   161
}
kpeter@802
   162
kpeter@802
   163
@article{goldberg88newapproach,
kpeter@790
   164
  author =       {Andrew V. Goldberg and Robert E. Tarjan},
kpeter@790
   165
  title =        {A new approach to the maximum flow problem},
kpeter@802
   166
  journal =      {Journal of the ACM},
kpeter@802
   167
  year =         1988,
kpeter@802
   168
  volume =       35,
kpeter@802
   169
  number =       4,
kpeter@802
   170
  pages =        {921-940}
kpeter@790
   171
}
kpeter@790
   172
kpeter@790
   173
@article{dinic70algorithm,
kpeter@790
   174
  author =       {E. A. Dinic},
kpeter@790
   175
  title =        {Algorithm for solution of a problem of maximum flow
kpeter@790
   176
                  in a network with power estimation},
kpeter@790
   177
  journal =      {Soviet Math. Doklady},
kpeter@790
   178
  year =         1970,
kpeter@790
   179
  volume =       11,
kpeter@790
   180
  pages =        {1277-1280}
kpeter@790
   181
}
kpeter@790
   182
kpeter@790
   183
@article{goldberg08partial,
kpeter@790
   184
  author =       {Andrew V. Goldberg},
kpeter@790
   185
  title =        {The Partial Augment-Relabel Algorithm for the
kpeter@790
   186
                  Maximum Flow Problem},
kpeter@790
   187
  journal =      {16th Annual European Symposium on Algorithms},
kpeter@790
   188
  year =         2008,
kpeter@790
   189
  pages =        {466-477}
kpeter@790
   190
}
kpeter@790
   191
kpeter@790
   192
@article{sleator83dynamic,
kpeter@790
   193
  author =       {Daniel D. Sleator and Robert E. Tarjan},
kpeter@790
   194
  title =        {A data structure for dynamic trees},
kpeter@790
   195
  journal =      {Journal of Computer and System Sciences},
kpeter@790
   196
  year =         1983,
kpeter@790
   197
  volume =       26,
kpeter@790
   198
  number =       3,
kpeter@790
   199
  pages =        {362-391}
kpeter@790
   200
}
kpeter@790
   201
kpeter@790
   202
kpeter@790
   203
%%%%% Minimum mean cycle algorithms %%%%%
kpeter@790
   204
kpeter@790
   205
@article{karp78characterization,
kpeter@790
   206
  author =       {Richard M. Karp},
kpeter@790
   207
  title =        {A characterization of the minimum cycle mean in a
kpeter@790
   208
                  digraph},
kpeter@790
   209
  journal =      {Discrete Math.},
kpeter@790
   210
  year =         1978,
kpeter@790
   211
  volume =       23,
kpeter@790
   212
  pages =        {309-311}
kpeter@790
   213
}
kpeter@790
   214
kpeter@1164
   215
@article{hartmann93finding,
kpeter@1164
   216
  author =       {Mark Hartmann and James B. Orlin},
kpeter@1164
   217
  title =        {Finding minimum cost to time ratio cycles with small
kpeter@1164
   218
                  integral transit times},
kpeter@1164
   219
  journal =      {Networks},
kpeter@1164
   220
  year =         1993,
kpeter@1164
   221
  volume =       23,
kpeter@1164
   222
  pages =        {567-574}
kpeter@1164
   223
}
kpeter@1164
   224
kpeter@790
   225
@article{dasdan98minmeancycle,
kpeter@790
   226
  author =       {Ali Dasdan and Rajesh K. Gupta},
kpeter@790
   227
  title =        {Faster Maximum and Minimum Mean Cycle Alogrithms for
kpeter@790
   228
                  System Performance Analysis},
kpeter@790
   229
  journal =      {IEEE Transactions on Computer-Aided Design of
kpeter@790
   230
                  Integrated Circuits and Systems},
kpeter@790
   231
  year =         1998,
kpeter@790
   232
  volume =       17,
kpeter@790
   233
  number =       10,
kpeter@790
   234
  pages =        {889-899}
kpeter@790
   235
}
kpeter@790
   236
kpeter@1164
   237
@article{dasdan04experimental,
kpeter@1164
   238
  author =       {Ali Dasdan},
kpeter@1164
   239
  title =        {Experimental analysis of the fastest optimum cycle
kpeter@1164
   240
                  ratio and mean algorithms},
kpeter@1164
   241
  journal =      {ACM Trans. Des. Autom. Electron. Syst.},
kpeter@1164
   242
  year =         2004,
kpeter@1164
   243
  volume =       9,
kpeter@1164
   244
  issue =        4,
kpeter@1164
   245
  pages =        {385-418}
kpeter@1164
   246
} 
kpeter@1164
   247
kpeter@790
   248
kpeter@790
   249
%%%%% Minimum cost flow algorithms %%%%%
kpeter@790
   250
kpeter@790
   251
@article{klein67primal,
kpeter@790
   252
  author =       {Morton Klein},
kpeter@790
   253
  title =        {A primal method for minimal cost flows with
kpeter@790
   254
                  applications to the assignment and transportation
kpeter@790
   255
                  problems},
kpeter@790
   256
  journal =      {Management Science},
kpeter@790
   257
  year =         1967,
kpeter@790
   258
  volume =       14,
kpeter@790
   259
  pages =        {205-220}
kpeter@790
   260
}
kpeter@790
   261
kpeter@802
   262
@article{goldberg89cyclecanceling,
kpeter@790
   263
  author =       {Andrew V. Goldberg and Robert E. Tarjan},
kpeter@790
   264
  title =        {Finding minimum-cost circulations by canceling
kpeter@790
   265
                  negative cycles},
kpeter@802
   266
  journal =      {Journal of the ACM},
kpeter@802
   267
  year =         1989,
kpeter@802
   268
  volume =       36,
kpeter@802
   269
  number =       4,
kpeter@802
   270
  pages =        {873-886}
kpeter@790
   271
}
kpeter@790
   272
kpeter@802
   273
@article{goldberg90approximation,
kpeter@790
   274
  author =       {Andrew V. Goldberg and Robert E. Tarjan},
kpeter@790
   275
  title =        {Finding Minimum-Cost Circulations by Successive
kpeter@790
   276
                  Approximation},
kpeter@790
   277
  journal =      {Mathematics of Operations Research},
kpeter@790
   278
  year =         1990,
kpeter@790
   279
  volume =       15,
kpeter@790
   280
  number =       3,
kpeter@790
   281
  pages =        {430-466}
kpeter@790
   282
}
kpeter@790
   283
kpeter@790
   284
@article{goldberg97efficient,
kpeter@790
   285
  author =       {Andrew V. Goldberg},
kpeter@790
   286
  title =        {An Efficient Implementation of a Scaling
kpeter@790
   287
                  Minimum-Cost Flow Algorithm},
kpeter@790
   288
  journal =      {Journal of Algorithms},
kpeter@790
   289
  year =         1997,
kpeter@790
   290
  volume =       22,
kpeter@790
   291
  number =       1,
kpeter@790
   292
  pages =        {1-29}
kpeter@790
   293
}
kpeter@790
   294
kpeter@790
   295
@article{bunnagel98efficient,
kpeter@790
   296
  author =       {Ursula B{\"u}nnagel and Bernhard Korte and Jens
kpeter@790
   297
                  Vygen},
kpeter@790
   298
  title =        {Efficient implementation of the {G}oldberg-{T}arjan
kpeter@790
   299
                  minimum-cost flow algorithm},
kpeter@790
   300
  journal =      {Optimization Methods and Software},
kpeter@790
   301
  year =         1998,
kpeter@790
   302
  volume =       10,
kpeter@790
   303
  pages =        {157-174}
kpeter@790
   304
}
kpeter@790
   305
kpeter@802
   306
@book{dantzig63linearprog,
kpeter@802
   307
  author =       {George B. Dantzig},
kpeter@802
   308
  title =        {Linear Programming and Extensions},
kpeter@802
   309
  publisher =    {Princeton University Press},
kpeter@802
   310
  year =         1963
kpeter@802
   311
}
kpeter@802
   312
kpeter@790
   313
@mastersthesis{kellyoneill91netsimplex,
kpeter@790
   314
  author =       {Damian J. Kelly and Garrett M. O'Neill},
kpeter@790
   315
  title =        {The Minimum Cost Flow Problem and The Network
kpeter@790
   316
                  Simplex Method},
kpeter@790
   317
  school =       {University College},
kpeter@790
   318
  address =      {Dublin, Ireland},
kpeter@790
   319
  year =         1991,
kpeter@999
   320
  month =        sep
kpeter@790
   321
}
kpeter@999
   322
kpeter@999
   323
%%%%% Other algorithms %%%%%
kpeter@999
   324
kpeter@999
   325
@article{grosso08maxclique,
kpeter@999
   326
  author =       {Andrea Grosso and Marco Locatelli and Wayne Pullan},
kpeter@999
   327
  title =        {Simple ingredients leading to very efficient
kpeter@999
   328
                  heuristics for the maximum clique problem},
kpeter@999
   329
  journal =      {Journal of Heuristics},
kpeter@999
   330
  year =         2008,
kpeter@999
   331
  volume =       14,
kpeter@999
   332
  number =       6,
kpeter@999
   333
  pages =        {587--612}
kpeter@999
   334
}