A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion (Q4189077)

From MaRDI portal
Revision as of 14:39, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3626947
Language Label Description Also known as
English
A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion
scientific article; zbMATH DE number 3626947

    Statements

    A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion (English)
    0 references
    0 references
    0 references
    1979
    0 references
    Heuristic Branch-And-Bound Algorithm
    0 references
    Telephone Feeder Capacity Expansion
    0 references
    Telephonic Networks
    0 references
    Case Study
    0 references
    Computational Efficiency
    0 references

    Identifiers

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