Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (Q4642425)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem |
scientific article; zbMATH DE number 6871420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8885824
0 references
0.87578255
0 references
0.8747066
0 references
0.8684719
0 references
0.86193717
0 references
0.85816395
0 references
0.85637224
0 references
0.8543768
0 references
0.85382783
0 references
