Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136)

From MaRDI portal
Revision as of 21:33, 17 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5587973
Language Label Description Also known as
English
Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
scientific article; zbMATH DE number 5587973

    Statements

    Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    prize collecting
    0 references
    network design
    0 references