doc/references.bib
changeset 1184 3c00344f49c9
parent 1002 f63ba40a60f4
child 1142 2f479109a71d
     1.1 --- a/doc/references.bib	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/doc/references.bib	Wed Oct 17 19:14:07 2018 +0200
     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 @@ -23,6 +22,28 @@
    1.14  }
    1.15  
    1.16  
    1.17 +%%%%% Papers related to LEMON %%%%%
    1.18 +
    1.19 +@article{DezsoJuttnerKovacs11Lemon,
    1.20 +  author =       {B. Dezs{\H o} and A. J\"uttner and P. Kov\'acs},
    1.21 +  title =        {{LEMON} -- an open source {C++} graph template library},
    1.22 +  journal =      {Electronic Notes in Theoretical Computer Science},
    1.23 +  volume =       {264},
    1.24 +  pages =        {23--45},
    1.25 +  year =         {2011},
    1.26 +  note =         {Proc. 2nd Workshop on Generative Technologies}
    1.27 +}
    1.28 +
    1.29 +@article{KiralyKovacs12MCF,
    1.30 +  author =       {Z. Kir\'aly and P. Kov\'acs},
    1.31 +  title =        {Efficient implementations of minimum-cost flow algorithms},
    1.32 +  journal =      {Acta Universitatis Sapientiae, Informatica},
    1.33 +  year =         {2012},
    1.34 +  volume =       {4},
    1.35 +  pages =        {67--118}
    1.36 +}
    1.37 +
    1.38 +
    1.39  %%%%% Other libraries %%%%%%
    1.40  
    1.41  @misc{boost,
    1.42 @@ -213,6 +234,16 @@
    1.43    pages =        {309-311}
    1.44  }
    1.45  
    1.46 +@article{hartmann93finding,
    1.47 +  author =       {Mark Hartmann and James B. Orlin},
    1.48 +  title =        {Finding minimum cost to time ratio cycles with small
    1.49 +                  integral transit times},
    1.50 +  journal =      {Networks},
    1.51 +  year =         1993,
    1.52 +  volume =       23,
    1.53 +  pages =        {567-574}
    1.54 +}
    1.55 +
    1.56  @article{dasdan98minmeancycle,
    1.57    author =       {Ali Dasdan and Rajesh K. Gupta},
    1.58    title =        {Faster Maximum and Minimum Mean Cycle Alogrithms for
    1.59 @@ -225,6 +256,17 @@
    1.60    pages =        {889-899}
    1.61  }
    1.62  
    1.63 +@article{dasdan04experimental,
    1.64 +  author =       {Ali Dasdan},
    1.65 +  title =        {Experimental analysis of the fastest optimum cycle
    1.66 +                  ratio and mean algorithms},
    1.67 +  journal =      {ACM Trans. Des. Autom. Electron. Syst.},
    1.68 +  year =         2004,
    1.69 +  volume =       9,
    1.70 +  issue =        4,
    1.71 +  pages =        {385-418}
    1.72 +} 
    1.73 +
    1.74  
    1.75  %%%%% Minimum cost flow algorithms %%%%%
    1.76  
    1.77 @@ -297,5 +339,18 @@
    1.78    school =       {University College},
    1.79    address =      {Dublin, Ireland},
    1.80    year =         1991,
    1.81 -  month =        sep,
    1.82 +  month =        sep
    1.83  }
    1.84 +
    1.85 +%%%%% Other algorithms %%%%%
    1.86 +
    1.87 +@article{grosso08maxclique,
    1.88 +  author =       {Andrea Grosso and Marco Locatelli and Wayne Pullan},
    1.89 +  title =        {Simple ingredients leading to very efficient
    1.90 +                  heuristics for the maximum clique problem},
    1.91 +  journal =      {Journal of Heuristics},
    1.92 +  year =         2008,
    1.93 +  volume =       14,
    1.94 +  number =       6,
    1.95 +  pages =        {587--612}
    1.96 +}