Integer and combinatorial optimization
Integer and combinatorial optimization
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The two level network design problem with secondary hop constraints
INOC'11 Proceedings of the 5th international conference on Network optimization
On the k edge-disjoint 2-hop-constrained paths polytope
Operations Research Letters
The k edge-disjoint 3-hop-constrained paths polytope
Discrete Optimization
On the directed hop-constrained shortest path problem
Operations Research Letters
A note on hop-constrained walk polytopes
Operations Research Letters
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
INFORMS Journal on Computing
| Hi-index | 0.00 |
We study the dominant of the convex hull of st-paths with at most k edges in a graph. A complete linear description is obtained for k==4 is given.