An efficient approximation algorithm for the survivable network design problem.

Harold N. Gabow Michel X. Goemans David P. Williamson

Published in: IPCO (1993)

Keyphrases

network design problem
approximation algorithms
network design
benders decomposition
branch and bound
mixed integer
minimal cost
transportation networks
mixed integer programming
valid inequalities
integer programming
lagrangian relaxation
special case
exact solution
lower bound
combinatorial optimization
np hard