Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem (Q4740330): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 18:09, 5 March 2024

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