Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (Q4642425)
From MaRDI portal
scientific article; zbMATH DE number 6871420
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem |
scientific article; zbMATH DE number 6871420 |
Statements
Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (English)
0 references
23 May 2018
0 references
survivable network
0 references
edge-disjoint paths
0 references
flow
0 references
hop-constrained path
0 references
integer programming formulation
0 references
\(k\)-edge-connected
0 references
aggregated formulations
0 references
separated formulations
0 references
