Combined capacity planning and concentrator location in computer communications networks

DOI10.1080/02331939008843606zbMath0711.90047OpenAlexW2032315678MaRDI QIDQ3496146

Gerrit K. Janssens, L. Kaufman, Fernand Broeckx

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939008843606

zbMATH Keywords

heuristicstore-and-forward networkjoint capacity assignment concentrator location problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Discrete location and assignment (90B80) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

On the exact solution of large-scale simple plant location problems

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for the capacitated concentrator location problem
• Centralized teleprocessing network design
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• A Dual-Based Procedure for Uncapacitated Facility Location
• NEWCLUST: An Algorithm for the Topological Design of Two-Level, Multidrop Teleprocessing Networks
• Integer Programming: Methods, Uses, Computations