A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings. Ventresca, M. & Ombuki, B. M. International Journal of Computational Intelligence and Applications, 5(2):267-281, 2005.
A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings. [link]Link  A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings. [link]Paper  bibtex   
@article{journals/ijcia/VentrescaO05,
  added-at = {2006-07-21T00:00:00.000+0200},
  author = {Ventresca, Mario and Ombuki, Beatrice M.},
  biburl = {https://www.bibsonomy.org/bibtex/245e7c252b5402f4b7d29774a3cae84b7/dblp},
  date = {2006-07-21},
  description = {dblp},
  ee = {http://dx.doi.org/10.1142/S1469026805001611},
  interhash = {83e8de3634287c98906a80cfd7b971d8},
  intrahash = {45e7c252b5402f4b7d29774a3cae84b7},
  journal = {International Journal of Computational Intelligence and Applications},
  keywords = {dblp},
  number = 2,
  pages = {267-281},
  timestamp = {2006-07-21T00:00:00.000+0200},
  title = {A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings.},
  url = {http://dblp.uni-trier.de/db/journals/ijcia/ijcia5.html#VentrescaO05},
  volume = 5,
  year = 2005
}

Downloads: 0