Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem (Q4740330)

From MaRDI portal
Revision as of 22:36, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3795680
Language Label Description Also known as
English
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
scientific article; zbMATH DE number 3795680

    Statements

    Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    network design
    0 references
    communication network
    0 references
    capacited minimal directed tree problem
    0 references
    integer linear programming
    0 references
    Dantzig-Wolfe decomposition
    0 references
    Lagrangean relaxation procedure
    0 references
    tight lower bounds
    0 references
    optimal solution
    0 references
    heuristics
    0 references
    approximate solutions
    0 references
    computational tests
    0 references
    0 references