doc/references.bib
changeset 1045 4e8787627db3
parent 904 c279b19abc62
child 1051 4f9a45a6d6f0
equal deleted inserted replaced
3:99f9cf94db6c 4:46874a3cc3d5
     2 
     2 
     3 @misc{lemon,
     3 @misc{lemon,
     4   key =          {LEMON},
     4   key =          {LEMON},
     5   title =        {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
     5   title =        {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
     6                   {O}ptimization in {N}etworks},
     6                   {O}ptimization in {N}etworks},
     7   howpublished = {\url{http://lemon.cs.elte.hu/}},
     7   howpublished = {\url{http://lemon.cs.elte.hu/}}
     8   year =         2009
       
     9 }
     8 }
    10 
     9 
    11 @misc{egres,
    10 @misc{egres,
    12   key =          {EGRES},
    11   key =          {EGRES},
    13   title =        {{EGRES} -- {E}gerv{\'a}ry {R}esearch {G}roup on
    12   title =        {{EGRES} -- {E}gerv{\'a}ry {R}esearch {G}roup on
   209                   digraph},
   208                   digraph},
   210   journal =      {Discrete Math.},
   209   journal =      {Discrete Math.},
   211   year =         1978,
   210   year =         1978,
   212   volume =       23,
   211   volume =       23,
   213   pages =        {309-311}
   212   pages =        {309-311}
       
   213 }
       
   214 
       
   215 @article{hartmann93finding,
       
   216   author =       {Mark Hartmann and James B. Orlin},
       
   217   title =        {Finding minimum cost to time ratio cycles with small
       
   218                   integral transit times},
       
   219   journal =      {Networks},
       
   220   year =         1993,
       
   221   volume =       23,
       
   222   pages =        {567-574}
   214 }
   223 }
   215 
   224 
   216 @article{dasdan98minmeancycle,
   225 @article{dasdan98minmeancycle,
   217   author =       {Ali Dasdan and Rajesh K. Gupta},
   226   author =       {Ali Dasdan and Rajesh K. Gupta},
   218   title =        {Faster Maximum and Minimum Mean Cycle Alogrithms for
   227   title =        {Faster Maximum and Minimum Mean Cycle Alogrithms for
   223   volume =       17,
   232   volume =       17,
   224   number =       10,
   233   number =       10,
   225   pages =        {889-899}
   234   pages =        {889-899}
   226 }
   235 }
   227 
   236 
       
   237 @article{dasdan04experimental,
       
   238   author =       {Ali Dasdan},
       
   239   title =        {Experimental analysis of the fastest optimum cycle
       
   240                   ratio and mean algorithms},
       
   241   journal =      {ACM Trans. Des. Autom. Electron. Syst.},
       
   242   year =         2004,
       
   243   volume =       9,
       
   244   issue =        4,
       
   245   pages =        {385-418}
       
   246 } 
       
   247 
   228 
   248 
   229 %%%%% Minimum cost flow algorithms %%%%%
   249 %%%%% Minimum cost flow algorithms %%%%%
   230 
   250 
   231 @article{klein67primal,
   251 @article{klein67primal,
   232   author =       {Morton Klein},
   252   author =       {Morton Klein},