Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm (Q4679783): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1057/palgrave.jors.2601821 / rank | |||
| 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.1057/palgrave.jors.2601821 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088814889 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1057/PALGRAVE.JORS.2601821 / rank | |||
Normal rank | |||
Latest revision as of 15:02, 30 December 2024
scientific article; zbMATH DE number 2177423
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm |
scientific article; zbMATH DE number 2177423 |
Statements
Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm (English)
0 references
21 June 2005
0 references
minimum spanning tree
0 references
branch-and-bound
0 references
Lagrangian relaxation
0 references
