A robust and scalable algorithm for the Steiner problem in graphs (Q1646683): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 23:37, 29 February 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
