COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/references.bib

    r1002 r904  
    55  title =        {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
    66                  {O}ptimization in {N}etworks},
    7   howpublished = {\url{http://lemon.cs.elte.hu/}}
     7  howpublished = {\url{http://lemon.cs.elte.hu/}},
     8  year =         2009
    89}
    910
     
    211212  volume =       23,
    212213  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}
    223214}
    224215
     
    235226}
    236227
    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 
    248228
    249229%%%%% Minimum cost flow algorithms %%%%%
Note: See TracChangeset for help on using the changeset viewer.