Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/net.20485 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.20485 / rank | |||
Normal rank | |||
Latest revision as of 03:27, 20 December 2024
scientific article
| 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 |
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
