An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134)

From MaRDI portal
Revision as of 05:02, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/mp/LjubicWPKMF06, #quickstatements; #temporary_batch_1731468600454)





scientific article
Language Label Description Also known as
English
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
scientific article

    Statements

    An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2006
    0 references
    branch-and-cut
    0 references
    Steiner arborescence
    0 references
    prize collecting
    0 references
    network design
    0 references
    0 references
    0 references

    Identifiers