A robust and scalable algorithm for the Steiner problem in graphs (Q1646683)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A robust and scalable algorithm for the Steiner problem in graphs |
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
