An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem

Published in EvoWorkshops, Volume 2037 of Springer Lecture Notes in Computer Science, pp. 20-29, 2001

View paper here

Bibtex:

@inproceedings{DBLP:conf/evoW/LjubicR01,
  author    = {Ivana Ljubic and
               G{\"{u}}nther R. Raidl},
  editor    = {Egbert J. W. Boers and
               Jens Gottlieb and
               Pier Luca Lanzi and
               Robert E. Smith and
               Stefano Cagnoni and
               Emma Hart and
               G{\"{u}}nther R. Raidl and
               H. Tijink},
  title     = {An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity
               Augmentation Problem},
  booktitle = {Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP,
               EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20,
               2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2037},
  pages     = {20--29},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-45365-2\_3},
  doi       = {10.1007/3-540-45365-2\_3},
  timestamp = {Sun, 02 Jun 2019 21:25:13 +0200},
  biburl    = {https://dblp.org/rec/conf/evoW/LjubicR01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}