The two-edge connectivity survivable-network design problem in planar graphs
Glencora BorradailePhilip N. KleinPublished in: CoRR (2013)
Keyphrases
- network design problem
- planar graphs
- approximation algorithms
- undirected graph
- network design
- weighted graph
- mixed integer programming
- branch and bound
- minimal cost
- np hard
- transportation networks
- integer programming
- mixed integer
- connected components
- worst case
- minimum cost
- valid inequalities
- special case
- lagrangian relaxation
- traveling salesman problem
- maximum likelihood
- upper bound
- binary variables