Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds (Q3703812)

From MaRDI portal
Revision as of 01:42, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
scientific article

    Statements

    Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds (English)
    0 references
    0 references
    0 references
    1985
    0 references
    computer communication network design
    0 references
    NP-complete
    0 references
    network layout
    0 references
    suboptimal solutions
    0 references
    lower bounds
    0 references
    approximation algorithm
    0 references
    concentrator capacity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references