Solving the delay-constrained capacitated minimum spanning tree problem using a dandelion-encoded evolutionary algorithm

  1. Pérez-Bellido, Á.M.
  2. Salcedo-Sanz, S.
  3. Ortiz-García, E.G.
  4. Portilla-Figueras, A.
  5. Naldi, M.
Liburu bilduma:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ISSN: 0302-9743,  1611-3349

ISBN: 9783540896937

Argitalpen urtea: 2008

Alea: 5361 LNAI

Orrialdeak: 151-160

Mota: Biltzar ekarpena

DOI: 10.1007/978-3-540-89694-4_16 GOOGLE SCHOLAR
Datuen iturria: Scopus