The capacitated maximal covering location problem with backup service
type: Item
instance of: scholarly article
title: The capacitated maximal covering location problem with backup service
zbMATH Open document ID: 0707.90066
DOI: 10.1007/BF02097800
author: Hasan Pirkul
author: David A. Schilling
published in: Annals of Operations Research
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 4162653
zbMATH Keywords: maximal covering location
zbMATH Keywords: emergency service
zbMATH Keywords: Lagrangian relaxation
MaRDI profile type: Publication
Wikidata QID: Q58615149
cites work: A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4198056
cites work: Topological design of centralized computer networks—formulations and algorithms
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: A note on the knapsack problem with special ordered sets
cites work: Efficient algorithms for the capacitated concentrator location problem
cites work: An integer programming model for the allocation of databases in a distributed computer system
cites work: The Maximal Covering Location Problem with Capacities on Total Workload
full work available at URL: https://doi.org/10.1007/bf02097800
OpenAlex ID: W1997392494
description: scientific article; zbMATH DE number 4162653