Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem (Q5690262)

From MaRDI portal
Revision as of 17:21, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 967141
Language Label Description Also known as
English
Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
scientific article; zbMATH DE number 967141

    Statements

    Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem (English)
    0 references
    0 references
    9 October 1997
    0 references
    telecommunications network design
    0 references
    capacitated centralized processing network
    0 references
    cutting plane algorithm
    0 references
    capacitated spanning tree problem
    0 references
    general-demand case
    0 references
    branch-and-cut
    0 references
    vehicle routing
    0 references

    Identifiers