doc/references.bib
changeset 755 134852d7fb0a
parent 754 2de0fc630899
child 904 c279b19abc62
equal deleted inserted replaced
1:a8ae8d89f157 2:427f15bfbf24
   148 }
   148 }
   149 
   149 
   150 
   150 
   151 %%%%% Maximum flow algorithms %%%%%
   151 %%%%% Maximum flow algorithms %%%%%
   152 
   152 
   153 @inproceedings{goldberg86newapproach,
   153 @article{edmondskarp72theoretical,
       
   154   author =       {Jack Edmonds and Richard M. Karp},
       
   155   title =        {Theoretical improvements in algorithmic efficiency
       
   156                   for network flow problems},
       
   157   journal =      {Journal of the ACM},
       
   158   year =         1972,
       
   159   volume =       19,
       
   160   number =       2,
       
   161   pages =        {248-264}
       
   162 }
       
   163 
       
   164 @article{goldberg88newapproach,
   154   author =       {Andrew V. Goldberg and Robert E. Tarjan},
   165   author =       {Andrew V. Goldberg and Robert E. Tarjan},
   155   title =        {A new approach to the maximum flow problem},
   166   title =        {A new approach to the maximum flow problem},
   156   booktitle =    {STOC '86: Proceedings of the Eighteenth Annual ACM
   167   journal =      {Journal of the ACM},
   157                   Symposium on Theory of Computing},
   168   year =         1988,
   158   year =         1986,
   169   volume =       35,
   159   publisher =    {ACM Press},
   170   number =       4,
   160   address =      {New York, NY},
   171   pages =        {921-940}
   161   pages =        {136-146}
       
   162 }
   172 }
   163 
   173 
   164 @article{dinic70algorithm,
   174 @article{dinic70algorithm,
   165   author =       {E. A. Dinic},
   175   author =       {E. A. Dinic},
   166   title =        {Algorithm for solution of a problem of maximum flow
   176   title =        {Algorithm for solution of a problem of maximum flow
   227   year =         1967,
   237   year =         1967,
   228   volume =       14,
   238   volume =       14,
   229   pages =        {205-220}
   239   pages =        {205-220}
   230 }
   240 }
   231 
   241 
   232 @inproceedings{goldberg88cyclecanceling,
   242 @article{goldberg89cyclecanceling,
   233   author =       {Andrew V. Goldberg and Robert E. Tarjan},
   243   author =       {Andrew V. Goldberg and Robert E. Tarjan},
   234   title =        {Finding minimum-cost circulations by canceling
   244   title =        {Finding minimum-cost circulations by canceling
   235                   negative cycles},
   245                   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},
   246   journal =      {Journal of the ACM},
   249   year =         1972,
   247   year =         1989,
   250   volume =       19,
   248   volume =       36,
   251   number =       2,
   249   number =       4,
   252   pages =        {248-264}
   250   pages =        {873-886}
   253 }
   251 }
   254 
   252 
   255 @inproceedings{goldberg87approximation,
   253 @article{goldberg90approximation,
   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},
   254   author =       {Andrew V. Goldberg and Robert E. Tarjan},
   269   title =        {Finding Minimum-Cost Circulations by Successive
   255   title =        {Finding Minimum-Cost Circulations by Successive
   270                   Approximation},
   256                   Approximation},
   271   journal =      {Mathematics of Operations Research},
   257   journal =      {Mathematics of Operations Research},
   272   year =         1990,
   258   year =         1990,
   295   year =         1998,
   281   year =         1998,
   296   volume =       10,
   282   volume =       10,
   297   pages =        {157-174}
   283   pages =        {157-174}
   298 }
   284 }
   299 
   285 
       
   286 @book{dantzig63linearprog,
       
   287   author =       {George B. Dantzig},
       
   288   title =        {Linear Programming and Extensions},
       
   289   publisher =    {Princeton University Press},
       
   290   year =         1963
       
   291 }
       
   292 
   300 @mastersthesis{kellyoneill91netsimplex,
   293 @mastersthesis{kellyoneill91netsimplex,
   301   author =       {Damian J. Kelly and Garrett M. O'Neill},
   294   author =       {Damian J. Kelly and Garrett M. O'Neill},
   302   title =        {The Minimum Cost Flow Problem and The Network
   295   title =        {The Minimum Cost Flow Problem and The Network
   303                   Simplex Method},
   296                   Simplex Method},
   304   school =       {University College},
   297   school =       {University College},
   305   address =      {Dublin, Ireland},
   298   address =      {Dublin, Ireland},
   306   year =         1991,
   299   year =         1991,
   307   month =        sep,
   300   month =        sep,
   308 }
   301 }
   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 }