A robust and scalable algorithm for the Steiner problem in graphs (Q1646683)

From MaRDI portal
Revision as of 23:37, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
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
    0 references
    0 references
    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
    0 references
    0 references
    0 references

    Identifiers