On the hop-constrained survivable network design problem with reliable edges

• Published in: Computers & operations research Vol. 64; pp. 159 - 167
• Main Authors: Botton, Quentin, Fortz, Bernard, Gouveia, Luis
• Format: Journal Article
• Language: English
• Published: New York Elsevier Ltd 01.12.2015; Pergamon Press Inc; Elsevier
• Subjects: Benders decomposition; Branch-and-cut algorithms; Computer Science; Costs; Design engineering; Economic analysis; Failure; Graph theory; Hop constraints; Mathematical problems; Minimum cost; Network design; Network flow problem; Networks; Operations Research; Studies; Survivability; Upgrading; Branch-and-cut algorithms; Network design; Benders decomposition; Survivability; Hop constraints

In this paper, we study the hop-constrained survivable network design problem with reliable edges. Given a graph with non-negative edge costs and node pairs Q, the hop-constrained survivable network design problem consists of constructing a minimum cost set of edges so that the induced subgraph cont...