#### Filter Results:

#### Publication Year

2002

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This article studies the polyhedral structure of the 4-node network design problem (NDP). Using a theorem from the previous work of this author, the facets of the 4-node NDP can be translated into facets of larger size problems. The knowledge of complete polyhedral description of the 4-node NDP is important because it implies complete knowledge of… (More)

— We consider the problem of designing a survivable telecommunication network using facilities of a fixed capacity. Given a graph G = (V,E), the traffic demand among the nodes, and the cost of installing facilities on the edges of G, we wish to design the minimum cost network, so that under any single edge failure, the network permits the flow of all… (More)

- ‹
- 1
- ›