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. 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
{"_id":"dPQKQN4mqZrFdAxYF","bibbaseid":"ventresca-ombuki-ageneticalgorithmforthedesignofminimumcosttwoconnectednetworkswithboundedrings-2005","author_short":["Ventresca, M.","Ombuki, B. M."],"bibdata":{"bibtype":"article","type":"article","added-at":"2006-07-21T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Ventresca"],"firstnames":["Mario"],"suffixes":[]},{"propositions":[],"lastnames":["Ombuki"],"firstnames":["Beatrice","M."],"suffixes":[]}],"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","bibtex":"@article{journals/ijcia/VentrescaO05,\n added-at = {2006-07-21T00:00:00.000+0200},\n author = {Ventresca, Mario and Ombuki, Beatrice M.},\n biburl = {https://www.bibsonomy.org/bibtex/245e7c252b5402f4b7d29774a3cae84b7/dblp},\n date = {2006-07-21},\n description = {dblp},\n ee = {http://dx.doi.org/10.1142/S1469026805001611},\n interhash = {83e8de3634287c98906a80cfd7b971d8},\n intrahash = {45e7c252b5402f4b7d29774a3cae84b7},\n journal = {International Journal of Computational Intelligence and Applications},\n keywords = {dblp},\n number = 2,\n pages = {267-281},\n timestamp = {2006-07-21T00:00:00.000+0200},\n title = {A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings.},\n url = {http://dblp.uni-trier.de/db/journals/ijcia/ijcia5.html#VentrescaO05},\n volume = 5,\n year = 2005\n}\n\n","author_short":["Ventresca, M.","Ombuki, B. M."],"key":"journals/ijcia/VentrescaO05","id":"journals/ijcia/VentrescaO05","bibbaseid":"ventresca-ombuki-ageneticalgorithmforthedesignofminimumcosttwoconnectednetworkswithboundedrings-2005","role":"author","urls":{"Link":"http://dx.doi.org/10.1142/S1469026805001611","Paper":"http://dblp.uni-trier.de/db/journals/ijcia/ijcia5.html#VentrescaO05"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/mario%20ventresca?items=1000","dataSources":["RLFDMZMWW7Ps5vpgQ","Ck8iJJ5zmAj377iYj","aABj84ppQaei4P3aS"],"keywords":["dblp"],"search_terms":["genetic","algorithm","design","minimum","cost","two","connected","networks","bounded","rings","ventresca","ombuki"],"title":"A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings.","year":2005}