doc/references.bib
changeset 1164 f63ba40a60f4
parent 999 c279b19abc62
child 1219 4f9a45a6d6f0
     1.1 --- a/doc/references.bib	Sun Jan 29 22:33:14 2012 +0100
     1.2 +++ b/doc/references.bib	Mon Jan 30 23:24:14 2012 +0100
     1.3 @@ -4,8 +4,7 @@
     1.4    key =          {LEMON},
     1.5    title =        {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
     1.6                    {O}ptimization in {N}etworks},
     1.7 -  howpublished = {\url{http://lemon.cs.elte.hu/}},
     1.8 -  year =         2009
     1.9 +  howpublished = {\url{http://lemon.cs.elte.hu/}}
    1.10  }
    1.11  
    1.12  @misc{egres,
    1.13 @@ -213,6 +212,16 @@
    1.14    pages =        {309-311}
    1.15  }
    1.16  
    1.17 +@article{hartmann93finding,
    1.18 +  author =       {Mark Hartmann and James B. Orlin},
    1.19 +  title =        {Finding minimum cost to time ratio cycles with small
    1.20 +                  integral transit times},
    1.21 +  journal =      {Networks},
    1.22 +  year =         1993,
    1.23 +  volume =       23,
    1.24 +  pages =        {567-574}
    1.25 +}
    1.26 +
    1.27  @article{dasdan98minmeancycle,
    1.28    author =       {Ali Dasdan and Rajesh K. Gupta},
    1.29    title =        {Faster Maximum and Minimum Mean Cycle Alogrithms for
    1.30 @@ -225,6 +234,17 @@
    1.31    pages =        {889-899}
    1.32  }
    1.33  
    1.34 +@article{dasdan04experimental,
    1.35 +  author =       {Ali Dasdan},
    1.36 +  title =        {Experimental analysis of the fastest optimum cycle
    1.37 +                  ratio and mean algorithms},
    1.38 +  journal =      {ACM Trans. Des. Autom. Electron. Syst.},
    1.39 +  year =         2004,
    1.40 +  volume =       9,
    1.41 +  issue =        4,
    1.42 +  pages =        {385-418}
    1.43 +} 
    1.44 +
    1.45  
    1.46  %%%%% Minimum cost flow algorithms %%%%%
    1.47