Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 09:56, 5 March 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
