Analysis of Linear Programming Relaxations for a Class of Connectivity Problems
We consider the analysis of linear programming (LP) relaxations for a class of connectivity problems. The central problem in the class is the survivable network design problem - the problem of designing a minimum cost undirected network satisfying prespecified connectivity requirements between every...
| Autor principal: | |
|---|---|
| Formato: | Working Paper |
| Idioma: | en_US |
| Publicado em: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Acesso em linha: | http://hdl.handle.net/1721.1/5195 |