Mixed planar/network facility location problems
type: Item
instance of: scholarly article
title: Mixed planar/network facility location problems
zbMATH Open document ID: 0628.90022
DOI: 10.1016/0305-0548(88)90029-9
author: Rajan Batta
author: Udatta S. Palekar
published in: Computers \& Operations Research
publication date: 1988-01-01T00:00:00Z
review text: We examine a modeling framework for facility location problems which allows for a mixture of planar and network components. Travel follows Manhattan travel directions within planar regions. Properties of this new representation are developd, and the p-median problem is analyzed in this context. Other location problems and modeling considerations are also briefly discussed.
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 4022988
zbMATH Keywords: facility location
zbMATH Keywords: network
zbMATH Keywords: Manhattan travel directions
zbMATH Keywords: planar regions
zbMATH Keywords: p-median
MaRDI profile type: Publication
full work available at URL: 0305-0548(88)90029-9
OpenAlex ID: W2144319167
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
cites work: Finding minimum rectilinear distance paths in the presence of barriers
cites work: Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
cites work: Finding efficient solutions for rectilinear distance location problems efficiently
cites work: Optimal Server Location on a Network Operating as an M/G/1 Queue
cites work: Locating a Mobile Server Queueing Facility on a Tree Network
cites work: Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
description: scientific article; zbMATH DE number 4022988