A dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem

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

Lecture Notes in Computer Science - Simulated Evolution and Learning ◽

10.1007/978-3-540-89694-4_16 ◽

2008 ◽

pp. 151-160 ◽

Cited By ~ 1

Author(s):

Ángel M. Pérez-Bellido ◽

Sancho Salcedo-Sanz ◽

Emilio G. Ortiz-García ◽

Antonio Portilla-Figueras ◽

Maurizio Naldi

Keyword(s):

Evolutionary Algorithm ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300) ◽

A simulated annealing approach for the capacitated minimum spanning tree problem

10.1109/iccima.1999.798569 ◽

2003 ◽

Cited By ~ 1

Author(s):

J. Torres-Jimenez ◽

R. Pinto-Elias ◽

A. Garcia-Romero

Keyword(s):

Simulated Annealing ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Two Phase Heuristic Algorithm for Mean Delay constrained Capacitated Minimum Spanning Tree Problem

The KIPS Transactions PartC ◽

10.3745/kipstc.2003.10c.3.367 ◽

2003 ◽

Vol 10C (3) ◽

pp. 367-376

Keyword(s):

Heuristic Algorithm ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Two Phase ◽

Mean Delay ◽

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) ◽

An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem

10.1109/cec.2000.870282 ◽

2002 ◽

Cited By ~ 24

Author(s):

G.R. Raidl

Keyword(s):

Evolutionary Algorithm ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_68 ◽

2004 ◽

pp. 805-818 ◽

Cited By ~ 7

Author(s):

Raja Jothi ◽

Balaji Raghavachari

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Lecture Notes in Computer Science - Parallel Problem Solving from Nature - PPSN VIII ◽

Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem

10.1007/978-3-540-30217-9_9 ◽

2004 ◽

pp. 81-90 ◽

Cited By ~ 5

Author(s):

Frank Neumann

Keyword(s):

Evolutionary Algorithm ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Multi Objective ◽

A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem

Euro-Par 2002 Parallel Processing - Lecture Notes in Computer Science ◽

10.1007/3-540-45706-2_54 ◽

2002 ◽

pp. 404-407 ◽

Cited By ~ 5

Author(s):

Jun Han ◽

Graham McMahon ◽

Stephen Sugden

Keyword(s):

Branch And Bound ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Branch And Bound Algorithm ◽

A genetic algorithm for the capacitated minimum spanning tree problem

2006 IEEE International Conference on Evolutionary Computation ◽

10.1109/cec.2006.1688383 ◽

2006 ◽

Cited By ~ 2

Author(s):

E.G. Macedo de Lacerda ◽

M.F. de Medeiros

Keyword(s):

Genetic Algorithm ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Heuristics for the multi-level capacitated minimum spanning tree problem

Optimization Letters ◽

10.1007/s11590-013-0607-8 ◽

2013 ◽

Vol 8 (2) ◽

pp. 435-446

Author(s):

Christos A. Pappas ◽

Angelos-Christos G. Anadiotis ◽

Chrysa A. Papagianni ◽

Iakovos S. Venieris

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽

Multi Level ◽

Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem

Computer Communications ◽

10.1016/j.comcom.2005.01.001 ◽

2005 ◽

Vol 28 (11) ◽

pp. 1371-1379 ◽

Cited By ~ 16

Author(s):

Yong-Jin Lee ◽

M. Atiquzzaman

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽