INFORMS Journal on Computing
Notes on polyhedra associated with hop-constrained paths
Operations Research Letters
On the directed hop-constrained shortest path problem
Operations Research Letters
The k edge-disjoint 3-hop-constrained paths polytope
Discrete Optimization
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
INFORMS Journal on Computing
Characterization of facets of the hop constrained chain polytope via dynamic programming
Discrete Applied Mathematics
Hi-index | 0.00 |
A hop-constrained walk is a walk with at most H arcs. The cases H=