Combined capacity planning and concentrator location in computer communications networks (Q3496146): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Integer Programming: Methods, Uses, Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEWCLUST: An Algorithm for the Topological Design of Two-Level, Multidrop Teleprocessing Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centralized teleprocessing network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the capacitated concentrator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319638 / rank
 
Normal rank

Latest revision as of 10:59, 21 June 2024

scientific article
Language Label Description Also known as
English
Combined capacity planning and concentrator location in computer communications networks
scientific article

    Statements

    Combined capacity planning and concentrator location in computer communications networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    store-and-forward network
    0 references
    joint capacity assignment concentrator location problem
    0 references
    heuristic
    0 references

    Identifiers

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