Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5891541)

From MaRDI portal
Revision as of 18:53, 7 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6033926
Language Label Description Also known as
English
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
scientific article; zbMATH DE number 6033926

    Statements

    Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (English)
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    hop constrained Steiner trees
    0 references
    connected facility location
    0 references
    mixed integer programming models
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references