Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153)
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: Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem |
scientific article; zbMATH DE number 6047272
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem |
scientific article; zbMATH DE number 6047272 |
Statements
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (English)
0 references
18 June 2012
0 references
network design
0 references
branch-and-cut
0 references
Fenchel cuts
0 references
MIP based local search
0 references
0 references
0 references
0 references
0 references
0 references
0.92827857
0 references
0.92131686
0 references
0.9171081
0 references
0.9104169
0 references
0.90854627
0 references
0.89503074
0 references
0 references
