Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue
From MaRDI portal
Publication:2462536
DOI10.1016/j.cor.2006.09.018zbMath1139.90027OpenAlexW2046949878MaRDI QIDQ2462536
Publication date: 30 November 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.09.018
location-allocationassignmentnetwork flowenhanced 911maximal-coverage facility-locationmutiobjective optimizationvs. backup coverage
Multi-objective and goal programming (90C29) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The capacitated maximal covering location problem with backup service
- Production and location on a network under demand uncertainty
- An improved branch and bound algorithm for mixed integer nonlinear programs
- An interactive algorithm for solving multiple objective integer linear programming problems
- An efficient heuristic for the expansion problem of cellular wireless networks
- Genetic Algorithms for Solving a Class of Constrained Nonlinear Integer Programs
- The Maximal Expected Covering Location Problem: Revisited
- Equity Maximizing Facility Location Schemes
- The Maximum Availability Location Problem
- Stochastic MOLP with Incomplete Information: An Interactive Approach with Recourse
This page was built for publication: Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue