Pages that link to "Item:Q3428909"
From MaRDI portal
The following pages link to Integer programming formulations for the two 4-hop-constrained paths problem (Q3428909):
Displayed 7 items.
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- Distance Transformation for Network Design Problems (Q5231681) (← links)
- Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786) (← links)
- (Q6087208) (← links)