Using a hybrid of exact and genetic algorithms to design survivable networks

Computers and Operations Research

Volumn 29, Issue 1, 2002, Pages 53-66

  Ghashghai, Elham ^a   Rardin, Ronald L ^b  

^a RAND 1700 Main Street ^*  (United States)

^b SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

Genetic algorithms; K trees; Network design

Indexed keywords

COMPUTER ANALYSIS; COPPER; DESIGN; GENETIC ALGORITHM; INFORMATION PROCESSING; SURVIVAL; TECHNOLOGY;

GENETIC ALGORITHMS; GRAPH THEORY; POLYNOMIALS;

SURVIVABLE NETWORKS;

BROADBAND NETWORKS;

GENETIC ALGORITHM;

EID: 0036028050     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00059-9     Document Type: Article

References (27)

1. Complexity of finding embeddings in a k-tree
2. Characterization and recognition of partial 3-trees
3. Linear time algorithms for NP-hard problems restricted to partial k-trees
4. The 2-connected Steiner subgraph polytope for series-parallel graphs
5. 4-free graphs
6. On Some optimization problems on k-trees and partial k-trees
7. Steiner trees, partial 2-trees, and minimum IFI networks
8. Linear time algorithms for survivable network design with low connectivity constraints on partial 3-trees
9. Graph searching, path-width, tree-width and related problems (a survey)
10. Using genetic algorithms to find "good" k-tree subgraphs
11. Integer polyhedra arising from certain network design problems with connectivity constraints
12. Computational results with a cutting plane algorithm for designing Telecommunication networks with low connectivity constaints
13. The Steiner tree polytope and related polyhedra
14. The dominant of the spanning tree polytope
15. The equivalent subgraph polytope and directed cut polyhedra on series-parallel graphs
16. Polyhedra of the equivalent subgraph problem and some edge connectivity problems
17. A dual-based algorithm for multi-level network design
18. On simple characterizations of k-trees
19. A dynamic programming approach to the dominating set problem on k-trees
20. A characterization of partial 3-tree
21. Minimum-weight two-connected spanning networks
22. Genetic algorithms and random keys for sequencing and optimization
23. Interval estimation of a global optimum for large combinatorial problems
24. Using confidence limits for the global optimum in combinatorial optimization