The capacitated maximal covering location problem with backup service

DOI10.1007/BF02097800zbMath0707.90066OpenAlexW1997392494WikidataQ58615149 ScholiaQ58615149MaRDI QIDQ920016

Hasan Pirkul, David A. Schilling

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02097800

zbMATH Keywords

Lagrangian relaxationmaximal covering locationemergency service

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

A service logistics model for simultaneous siting of facilities and multiple levels of equipment ⋮ Service system design for managing interruption risks: a backup-service risk-mitigation strategy ⋮ Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions ⋮ Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue ⋮ An analysis of \(p\)-median location problem: effects of backup service level and demand assignment policy ⋮ Capacitated emergency facility siting with multiple levels of backup ⋮ A taxonomy for emergency service station location problem ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm ⋮ Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem ⋮ A Lagrangean heuristic for the maximal covering location problem ⋮ Use of location-allocation models in health service development planning in developing nations

Cites Work

• Unnamed Item
• An integer programming model for the allocation of databases in a distributed computer system
• Efficient algorithms for the capacitated concentrator location problem
• A note on the knapsack problem with special ordered sets
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• The Maximal Covering Location Problem with Capacities on Total Workload
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Topological design of centralized computer networks—formulations and algorithms
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: The capacitated maximal covering location problem with backup service