Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Ángel M. Pérez-Bellido, Sancho Salcedo-Sanz, Emilio G. Ortíz-García, Antonio Portilla-Figueras, Maurizio Naldi. Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm. In Xiaodong Li, Michael Kirley, Mengjie Zhang, David G. Green, Victor Ciesielski, Hussein A. Abbass, Zbigniew Michalewicz, Tim Hendtlass, Kalyanmoy Deb, Kay Chen Tan, Jürgen Branke, Yuhui Shi, editors, Simulated Evolution and Learning, 7th International Conference, SEAL 2008, Melbourne, Australia, December 7-10, 2008. Proceedings. Volume 5361 of Lecture Notes in Computer Science, pages 151-160, Springer, 2008. [doi]

This author has not been identified. Look up 'Ángel M. Pérez-Bellido' in GoogleThis author has not been identified. Look up 'Sancho Salcedo-Sanz' in GoogleThis author has not been identified. Look up 'Emilio G. Ortíz-García' in GoogleThis author has not been identified. Look up 'Antonio Portilla-Figueras' in GoogleThis author has not been identified. Look up 'Maurizio Naldi' in Google

runs on WebDSL