The two‐edge connected hop‐constrained network design problem: Valid inequalities and branch‐and‐cut
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- On the k edge-disjoint 2-hop-constrained paths polytopeOperations Research Letters, 2006
- A note on hop-constrained walk polytopesOperations Research Letters, 2004
- On the directed hop-constrained shortest path problemOperations Research Letters, 2004
- Internet Routing and Related Topology IssuesSIAM Journal on Discrete Mathematics, 2003
- Constrained length connectivity and survivable networksNetworks, 2000
- Notes on polyhedra associated with hop-constrained pathsOperations Research Letters, 1999
- The 2-hop spanning tree problemOperations Research Letters, 1998
- The K-Walk Polyhedron1994
- Using a Hop-Constrained Model to Generate Alternative Communication Network DesignINFORMS Journal on Computing, 1992
- Graph Theory with Applications1976