A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933): 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.1007/s10898-009-9430-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072878203 / rank | |||
Normal rank | |||
Revision as of 01:16, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid heuristic for the diameter constrained minimum spanning tree problem |
scientific article |
Statements
A hybrid heuristic for the diameter constrained minimum spanning tree problem (English)
0 references
15 March 2010
0 references
GRASP
0 references
iterated local search
0 references
