Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut |
scientific article |
Statements
Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (English)
0 references
13 January 2006
0 references
network design problem
0 references
branch-and-cut algorithm
0 references
