Locating concentrators for primary and secondary coverage in a computer communications network
Authors:
- H. PirkulHPH. Pirkul
- S. NarasimhanSNS. Narasimhan
- P. DePDP. De
- 1 April 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 36 (4) , 450-458
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Computer and Database Location in Distributed Computer SystemsIEEE Transactions on Computers, 1986
- 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 Optimal Route Selection in SNA NetworksIEEE Transactions on Communications, 1983
- A note of the knapsack problem with special ordered setsOperations Research Letters, 1981
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- Network Design: An Algorithm for the Access Facility Location ProblemIEEE Transactions on Communications, 1977
- Validation of subgradient optimizationMathematical Programming, 1974
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- A Heuristic Program for Locating WarehousesManagement Science, 1963