Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP (Q4688185)

From MaRDI portal
Revision as of 20:37, 2 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6961140
Language Label Description Also known as
English
Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP
scientific article; zbMATH DE number 6961140

    Statements

    Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP (English)
    0 references
    0 references
    0 references
    22 October 2018
    0 references
    prize-collecting Steiner tree problem
    0 references
    maximum-weight connected subgraph problem
    0 references
    graph transformations
    0 references
    dual-ascent heuristics
    0 references

    Identifiers