Lower and upper bounds for the degree-constrained minimum spanning tree problem (Q3593370): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: Q4350039 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4845371 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040221 / rank | |||
Normal rank | |||
Latest revision as of 12:37, 26 June 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
