Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/seal/Perez-BellidoSOPN08
%A Pérez-Bellido, Ángel M.
%A Salcedo-Sanz, Sancho
%A Ortíz-García, Emilio G.
%A Portilla-Figueras, Antonio
%A Naldi, Maurizio
%B SEAL
%D 2008
%E Li, Xiaodong
%E Kirley, Michael
%E Zhang, Mengjie
%E Green, David G.
%E Ciesielski, Victor
%E Abbass, Hussein A.
%E Michalewicz, Zbigniew
%E Hendtlass, Tim
%E Deb, Kalyanmoy
%E Tan, Kay Chen
%E Branke, Jürgen
%E Shi, Yuhui
%I Springer
%K dblp
%P 151-160
%T Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm.
%U http://dblp.uni-trier.de/db/conf/seal/seal2008.html#Perez-BellidoSOPN08
%V 5361
%@ 978-3-540-89693-7
@inproceedings{conf/seal/Perez-BellidoSOPN08,
added-at = {2023-03-21T00:00:00.000+0100},
author = {Pérez-Bellido, Ángel M. and Salcedo-Sanz, Sancho and Ortíz-García, Emilio G. and Portilla-Figueras, Antonio and Naldi, Maurizio},
biburl = {https://www.bibsonomy.org/bibtex/26bcc73205878583be6c8a771480cf857/dblp},
booktitle = {SEAL},
crossref = {conf/seal/2008},
editor = {Li, Xiaodong and Kirley, Michael and Zhang, Mengjie and Green, David G. and Ciesielski, Victor and Abbass, Hussein A. and Michalewicz, Zbigniew and Hendtlass, Tim and Deb, Kalyanmoy and Tan, Kay Chen and Branke, Jürgen and Shi, Yuhui},
ee = {https://doi.org/10.1007/978-3-540-89694-4_16},
interhash = {28072d5c634eae0cd231ecf56fdf10d9},
intrahash = {6bcc73205878583be6c8a771480cf857},
isbn = {978-3-540-89693-7},
keywords = {dblp},
pages = {151-160},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-09T10:32:57.000+0200},
title = {Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm.},
url = {http://dblp.uni-trier.de/db/conf/seal/seal2008.html#Perez-BellidoSOPN08},
volume = 5361,
year = 2008
}