Pages that link to "Item:Q4642425"
From MaRDI portal
The following pages link to Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (Q4642425):
Displaying 8 items.
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- On the number of edges in a graph with many two-hop disjoint paths (Q2192123) (← links)
- On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints (Q3156822) (← links)
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (Q3418127) (← links)
- Integer programming formulations for the two 4-hop-constrained paths problem (Q3428909) (← links)
- Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties (Q6167421) (← links)
- A computational study on integer programming formulations for hop-constrained survivable network design (Q6657263) (← links)
