Local search with perturbations for the prize-collecting Steiner tree problem in graphs (Q2747806): 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.1023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991107961 / rank | |||
Normal rank | |||
Revision as of 20:25, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local search with perturbations for the prize-collecting Steiner tree problem in graphs |
scientific article |
Statements
Local search with perturbations for the prize-collecting Steiner tree problem in graphs (English)
0 references
14 October 2001
0 references
Steiner problem
0 references
path-relinking
0 references
variable neighborhood search
0 references
network design
0 references
