On the directed hop-constrained shortest path problem
- 1 January 2004
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 32 (1) , 15-22
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The cardinality-constrained shortest path problem in 2-graphsNetworks, 2000
- Notes on polyhedra associated with hop-constrained pathsOperations Research Letters, 1999
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop ConstraintsINFORMS Journal on Computing, 1998
- Using a Hop-Constrained Model to Generate Alternative Communication Network DesignINFORMS Journal on Computing, 1992