Lower and upper bounds for the degree-constrained minimum spanning tree problem (Q3593370): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20166 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4251562717 / rank | |||
Normal rank | |||
Revision as of 19:10, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower and upper bounds for the degree-constrained minimum spanning tree problem |
scientific article |
Statements
Lower and upper bounds for the degree-constrained minimum spanning tree problem (English)
0 references
20 July 2007
0 references
Lagrangian relaxation
0 references
non-delayed relax-and-cut
0 references
Lagrangian warm start to cutting plane algorithms
0 references
degree constrained minimum spanning tree
0 references
blossom inequalities
0 references
