A cutting plane algorithm for computing k-edge survivability of a network
Article Abstract:
The problem of computing k-edge survivability is known to be NP-hard and no algorithm other than simple enumeration had been found. A preprocessing procedure of reducing the problem size, a heuristic of providing a low bound, and a cutting plane algorithm of obtaining an upper bound are presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
An approximation algorithm for computing longest paths
Article Abstract:
The color-coding method proposed by Alon et al., in its version specialized to compute simple paths of specified cardinality k are examined. The method can be extended both to approximate the maximum cardinality of the simple paths and also to address the presence of arc lengths.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A tabu search algorithm for self-healing ring network design. Solving spread spectrum radar polyphase code design problem by tabu search and variable neighborhood search
- Abstracts: Spring clean your finances. Hub of activity. Judge and jury
- Abstracts: A generalized dual phase-2 simplex algorithm. The impact of energy function structure on solving generalized assignment problem using Hopfield neural network
- Abstracts: Vehicle routing problem with time windows and a limited number of vehicles. Problem structuring methods in action