A genetic algorithm for the capacitated minimum spanning tree problem

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 725-729

  De Lacerda, Estéfane George Macedo ^a   De Medeiros Jr , Manoel Firmino ^a  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DECISION TREES; MATHEMATICAL OPERATORS; PROBLEM SOLVING; TELECOMMUNICATION SYSTEMS;

CAPACITATED MINIMUM SPANNING TREE PROBLEM; ROOTED SUBTREES;

GENETIC ALGORITHMS;

EID: 34547334276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Ravindra K. Ahuja, James B. Orlin, and Dushyant Sharma. Multiexchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Program, 91:71-97, 2001.
2. Ravindra K. Ahuja, James B. Orlin, and Dushyant Sharma. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operations Research Letters, 31:185-194, 2003.
3. A. Amberg, W. Domschke, and S. Vob. Capacitated minimum spanning trees: Algorithms using intelligent search. Combinatorial Optimization: Theory and Practice, 1(1):9-39, 1996.
4. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, second edition, 2001.
5. M.C. de Souza, C. Duhamel, and CC. Ribeiro. A GRASP heuristic for me capacitated minimum spanning tree problem using a memory-based local search strategy. In M.G.C. Resende and J.R de Sousa, editors, Metaheuristics: Computer decision-making, pages 627-658. Kluwer Academic Publishers, 2003.
6. B. Gavish. Topological design of telecommunication networks - local access design methods. Annals of Operations Research, 33:17-71, 1991.
7. C. H. Papadimitriou. The complexity of the capacitated tree problem. Networks, 8:217-230, 1978.
8. R. Patterson, E. Rolland, and H. Pirkul. A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem. Journal of Heuristics, 5(2):159-180, 1999.
9. Günther R. Raidl and Christina Drexel. A predecessor coding in an evolutionary algorithm for the capacitated minimum spanning tree problem. In Chris Armstrong, editor, Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference, pages 309-316, Las Vegas, NV, 2000.
10. M. Reimann and M. Laumanns. A hybrid ACO algorithm for the capacitated minimum spanning tree problem. In Christian Blum, Andrea Roli, and Michael Sampels, editors, Proceedings of First International Workshop on Hybrid Metaheuristics (HM2004), 2004.
11. E. Rolland, R. Patterson, and H. Pirkul. Memory adaptive reasoning and greedy assignment techniques for the capacitated minimum spanning tree problem. In Advances in Metaheuristics, pages 485-497. Kluwer Academic, 1998.
12. Y. M. Sharaiha, M. Gendreau, G. Laporte, and I. H. Osman. A tabu search algorithm for the capacitated shortest spanning tree problem. Networks, 29:161-171, 1997.