On minimum cost isolated failure immune networks

Telecommunication Systems

Volumn 3, Issue 2, 1994, Pages 183-200

  Beltrán, Héctor Fernando ^a   Skorin Kapov, Darko ^a  

^a STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1442325227     PISSN: 10184864     EISSN: 15729451     Source Type: Journal    
DOI: 10.1007/BF02110142     Document Type: Article

References (13)

1. Networks immune to isolated failures
2. Tabu search — Part I
3. Tabu search — Part II
4. Tabu search
5. NC-algorithms for the recognition of partial 2-trees and partial 3-trees
6. Facets for polyhedra arising in the design of communication networks with low-connectivity constraints
7. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints
8. A new set of spatial interaction models, The Theory of Competing Destination
9. Methods for designing communications networks with certain two-connected surviviability constraints
10. On simple characterizations of k-trees
11. Steiner trees, partial 2-trees and minimum IFI networks