The K-coverage concentrator location problem
DOI10.1016/0307-904X(92)90086-IzbMATH Open0756.90058OpenAlexW2060686653MaRDI QIDQ1193145FDOQ1193145
Authors: Bala Shetty, Rathindra Sarathy, Arun Sen 
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
Recommendations
Lagrangian relaxationsubgradient algorithmcomputer networks\(K\)-coverage problemcentralized teleprocessing networksingle-source capacitated warehouse location
Reliability, availability, maintenance, inspection in operations research (90B25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Validation of subgradient optimization
- Title not available (Why is that?)
- A branch and bound algorithm for the generalized assignment problem
- Efficient algorithms for the capacitated concentrator location problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Large-Scale Network Topological Optimization
- A generalization of Polyak's convergence result for subgradient optimization
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
Cited In (11)
- Computing and Combinatorics
- Title not available (Why is that?)
- Budget-constrained, capacitated hub location to maximize expected demand coverage in fixed-wireless telecommunication networks
- Title not available (Why is that?)
- Efficient algorithms for the capacitated concentrator location problem
- Title not available (Why is that?)
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- Title not available (Why is that?)
- A local relaxation approach for the siting of electrical substations
- The multimode covering location problem
- Application of the facility location problem to the problem of locating concentrators on an FAA microwave system
This page was built for publication: The \(K\)-coverage concentrator location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193145)
