Solving rectilinear planar location problems with barriers by a polynomial partitioning
type: Item
instance of: scholarly article
title: Solving rectilinear planar location problems with barriers by a polynomial partitioning
zbMATH Open document ID: 1041.90027
DOI: 10.1023/A:1020997518554
author: P. M. Dearing
author: R. Segars jun.
published in: Annals of Operations Research
publication date: 2003-05-04T00:00:00Z
review text: The reduced domain obtained in the companion paper [ibid. 111, 89--110 (1992; Zbl 1041.90026)] is further split into a network connecting the fixed points and a polynomial number of convex cells. Each barrier \(l_1\)-distance to a fixed point equals the shortest path distance on the network, and is linear on each cell. Minimising any nondecreasing convex function of these distances is thereby reduced to a location problem on a network and a finite number of constrained convex minimisation problems, all solvable by standard methods.
reviewed by: Frank Plastria
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1904018
zbMATH Keywords: single facility location
zbMATH Keywords: rectilinear distance
zbMATH Keywords: barrier
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1904018