Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145)
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: Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut |
scientific article; zbMATH DE number 2246767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut |
scientific article; zbMATH DE number 2246767 |
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
0.9067489
0 references
0.8956194
0 references
0 references
0.8788446
0 references
0.87091744
0 references
0.86935663
0 references
0.86885214
0 references
0.86716634
0 references
