Pages that link to "Item:Q429666"
From MaRDI portal
The following pages link to The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666):
Displaying 16 items.
- Length 3 edge-disjoint paths is NP-hard (Q445249) (← links)
- A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Composition of graphs and the hop-constrained path problem (Q1758872) (← links)
- Notes on polyhedra associated with hop-constrained paths (Q1807932) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- Trade-offs among degree, diameter, and number of paths (Q2112655) (← links)
- On the number of edges in a graph with many two-hop disjoint paths (Q2192123) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope (Q2480058) (← links)
- Integer programming formulations for the two 4-hop-constrained paths problem (Q3428909) (← links)
- Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (Q4642425) (← links)
- Distance Transformation for Network Design Problems (Q5231681) (← links)
- Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
