Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem (Q3026701)

From MaRDI portal
Revision as of 01:05, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)





scientific article
Language Label Description Also known as
English
Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
scientific article

    Statements

    Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem (English)
    0 references
    0 references
    0 references
    1987
    0 references
    Network design
    0 references
    Optimum Communication Spanning Tree
    0 references
    branch and bound
    0 references
    heuristic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references