A robust and scalable algorithm for the Steiner problem in graphs (Q1646683): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s12532-017-0123-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S12532-017-0123-4 / rank | |||
Normal rank | |||
Latest revision as of 00:42, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A robust and scalable algorithm for the Steiner problem in graphs |
scientific article |
Statements
A robust and scalable algorithm for the Steiner problem in graphs (English)
0 references
25 June 2018
0 references
Steiner trees
0 references
local search
0 references
metaheuristics
0 references
dual ascent
0 references
0 references
0 references
0 references
0 references
