1.1 --- a/doc/references.bib	Sat Oct 10 08:15:07 2009 +0200
     1.2 +++ b/doc/references.bib	Sat Oct 10 08:18:46 2009 +0200
     1.3 @@ -150,15 +150,25 @@
     1.4  
     1.5  %%%%% Maximum flow algorithms %%%%%
     1.6  
     1.7 -@inproceedings{goldberg86newapproach,
     1.8 +@article{edmondskarp72theoretical,
     1.9 +  author =       {Jack Edmonds and Richard M. Karp},
    1.10 +  title =        {Theoretical improvements in algorithmic efficiency
    1.11 +                  for network flow problems},
    1.12 +  journal =      {Journal of the ACM},
    1.13 +  year =         1972,
    1.14 +  volume =       19,
    1.15 +  number =       2,
    1.16 +  pages =        {248-264}
    1.17 +}
    1.18 +
    1.19 +@article{goldberg88newapproach,
    1.20    author =       {Andrew V. Goldberg and Robert E. Tarjan},
    1.21    title =        {A new approach to the maximum flow problem},
    1.22 -  booktitle =    {STOC '86: Proceedings of the Eighteenth Annual ACM
    1.23 -                  Symposium on Theory of Computing},
    1.24 -  year =         1986,
    1.25 -  publisher =    {ACM Press},
    1.26 -  address =      {New York, NY},
    1.27 -  pages =        {136-146}
    1.28 +  journal =      {Journal of the ACM},
    1.29 +  year =         1988,
    1.30 +  volume =       35,
    1.31 +  number =       4,
    1.32 +  pages =        {921-940}
    1.33  }
    1.34  
    1.35  @article{dinic70algorithm,
    1.36 @@ -229,42 +239,18 @@
    1.37    pages =        {205-220}
    1.38  }
    1.39  
    1.40 -@inproceedings{goldberg88cyclecanceling,
    1.41 +@article{goldberg89cyclecanceling,
    1.42    author =       {Andrew V. Goldberg and Robert E. Tarjan},
    1.43    title =        {Finding minimum-cost circulations by canceling
    1.44                    negative cycles},
    1.45 -  booktitle =    {STOC '88: Proceedings of the Twentieth Annual ACM
    1.46 -                  Symposium on Theory of Computing},
    1.47 -  year =         1988,
    1.48 -  publisher =    {ACM Press},
    1.49 -  address =      {New York, NY},
    1.50 -  pages =        {388-397}
    1.51 +  journal =      {Journal of the ACM},
    1.52 +  year =         1989,
    1.53 +  volume =       36,
    1.54 +  number =       4,
    1.55 +  pages =        {873-886}
    1.56  }
    1.57  
    1.58 -@article{edmondskarp72theoretical,
    1.59 -  author =       {Jack Edmonds and Richard M. Karp},
    1.60 -  title =        {Theoretical improvements in algorithmic efficiency
    1.61 -                  for network flow problems},
    1.62 -  journal =      {Journal of the ACM},
    1.63 -  year =         1972,
    1.64 -  volume =       19,
    1.65 -  number =       2,
    1.66 -  pages =        {248-264}
    1.67 -}
    1.68 -
    1.69 -@inproceedings{goldberg87approximation,
    1.70 -  author =       {Andrew V. Goldberg and Robert E. Tarjan},
    1.71 -  title =        {Solving minimum-cost flow problems by successive
    1.72 -                  approximation},
    1.73 -  booktitle =    {STOC '87: Proceedings of the Nineteenth Annual ACM
    1.74 -                  Symposium on Theory of Computing},
    1.75 -  year =         1987,
    1.76 -  publisher =    {ACM Press},
    1.77 -  address =      {New York, NY},
    1.78 -  pages =        {7-18}
    1.79 -}
    1.80 -
    1.81 -@article{goldberg90finding,
    1.82 +@article{goldberg90approximation,
    1.83    author =       {Andrew V. Goldberg and Robert E. Tarjan},
    1.84    title =        {Finding Minimum-Cost Circulations by Successive
    1.85                    Approximation},
    1.86 @@ -297,6 +283,13 @@
    1.87    pages =        {157-174}
    1.88  }
    1.89  
    1.90 +@book{dantzig63linearprog,
    1.91 +  author =       {George B. Dantzig},
    1.92 +  title =        {Linear Programming and Extensions},
    1.93 +  publisher =    {Princeton University Press},
    1.94 +  year =         1963
    1.95 +}
    1.96 +
    1.97  @mastersthesis{kellyoneill91netsimplex,
    1.98    author =       {Damian J. Kelly and Garrett M. O'Neill},
    1.99    title =        {The Minimum Cost Flow Problem and The Network
   1.100 @@ -306,25 +299,3 @@
   1.101    year =         1991,
   1.102    month =        sep,
   1.103  }
   1.104 -
   1.105 -@techreport{lobel96networksimplex,
   1.106 -  author =       {Andreas L{\"o}bel},
   1.107 -  title =        {Solving large-scale real-world minimum-cost flow
   1.108 -                  problems by a network simplex method},
   1.109 -  institution =  {Konrad-Zuse-Zentrum fur Informationstechnik Berlin
   1.110 -                  ({ZIB})},
   1.111 -  address =      {Berlin, Germany},
   1.112 -  year =         1996,
   1.113 -  number =       {SC 96-7}
   1.114 -}
   1.115 -
   1.116 -@article{frangioni06computational,
   1.117 -  author =       {Antonio Frangioni and Antonio Manca},
   1.118 -  title =        {A Computational Study of Cost Reoptimization for
   1.119 -                  Min-Cost Flow Problems},
   1.120 -  journal =      {INFORMS Journal On Computing},
   1.121 -  year =         2006,
   1.122 -  volume =       18,
   1.123 -  number =       1,
   1.124 -  pages =        {61-70}
   1.125 -}