The \(K\)-coverage concentrator location problem

DOI10.1016/0307-904X(92)90086-IzbMath0756.90058OpenAlexW2060686653MaRDI QIDQ1193145

Arun Sen, Rathindra Sarathy, Bala Shetty

Publication date: 27 September 1992

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0307-904x(92)90086-i

zbMATH Keywords

Lagrangian relaxationsubgradient algorithmcomputer networks\(K\)-coverage problemcentralized teleprocessing networksingle-source capacitated warehouse location

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for the capacitated concentrator location problem
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A generalization of Polyak's convergence result for subgradient optimization
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A branch and bound algorithm for the generalized assignment problem
• Large-Scale Network Topological Optimization
• Validation of subgradient optimization