Efficient algorithms for the capacitated concentrator location problem
- 1 January 1987
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 14 (3) , 197-208
- https://doi.org/10.1016/0305-0548(87)90022-0
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source ConstraintsJournal of the Operational Research Society, 1986
- Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and boundsNetworks, 1985
- An Algorithm for the Fixed-Charge Assigning Users to Sources ProblemJournal of the Operational Research Society, 1983
- Topological design of centralized computer networks—formulations and algorithmsNetworks, 1982
- Database Location in Computer NetworksJournal of the ACM, 1980
- An Improved Algorithm for the Capacitated Facility Location ProblemJournal of the Operational Research Society, 1978
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- NEWCLUST: An Algorithm for the Topological Design of Two-Level, Multidrop Teleprocessing NetworksIEEE Transactions on Communications, 1978
- Network Design: An Algorithm for the Access Facility Location ProblemIEEE Transactions on Communications, 1977
- Large-Scale Network Topological OptimizationIEEE Transactions on Communications, 1977