The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (Q3418127)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut |
scientific article |
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
