A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585)

From MaRDI portal
Revision as of 10:46, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1626204
Language Label Description Also known as
English
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
scientific article; zbMATH DE number 1626204

    Statements

    A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    2001
    0 references
    0 references
    Design of centralized networks
    0 references
    Quality of service constraints
    0 references
    Hop constraints
    0 references
    Lagrangean relaxation
    0 references
    Multicommodity flows
    0 references
    minimum spanning tree
    0 references
    centralized telecommunication networks
    0 references
    linear programming relaxation
    0 references
    0 references
    0 references