The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs.
Glencora BorradailePhilip N. KleinPublished in: ACM Trans. Algorithms (2016)
Keyphrases
- network design problem
- planar graphs
- undirected graph
- approximation algorithms
- network design
- branch and bound
- weighted graph
- transportation networks
- minimal cost
- mixed integer programming
- mixed integer
- connected components
- integer programming
- special case
- np hard
- lagrangian relaxation
- worst case
- linear program
- binary variables
- minimum cost
- valid inequalities
- lower bound
- probability distribution
- column generation
- search algorithm
- computationally expensive
- belief propagation