The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (Q3418127)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5121252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut |
scientific article; zbMATH DE number 5121252 |
Statements
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (English)
0 references
2 February 2007
0 references
network design
0 references
edge connectivity
0 references
hop-constraints
0 references
NP-hardness
0 references
valid inequalities facets
0 references
branch-and-cut
0 references
0.8612117767333984
0 references
0.8504846692085266
0 references
0.8483591079711914
0 references
0.8437625765800476
0 references
0.8216577172279358
0 references
