An algorithm for the steiner problem in graphs (Q5896365): 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.3230140112 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008771115 / rank | |||
Normal rank | |||
Revision as of 20:17, 19 March 2024
scientific article; zbMATH DE number 3860849
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the steiner problem in graphs |
scientific article; zbMATH DE number 3860849 |
Statements
An algorithm for the steiner problem in graphs (English)
0 references
1984
0 references
location on graphs
0 references
logistics
0 references
Lagrangian relaxation
0 references
Steiner problem
0 references
lower bounds on the minimum cost
0 references
tree search procedure
0 references
Computational tests
0 references
