An equivalence result for single facility planar location problems with rectilinear distance and barriers (Q1872029): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1020945501716 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W173691322 / rank | |||
Normal rank |
Latest revision as of 11:54, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An equivalence result for single facility planar location problems with rectilinear distance and barriers |
scientific article |
Statements
An equivalence result for single facility planar location problems with rectilinear distance and barriers (English)
0 references
4 May 2003
0 references
In a plane with a finite set of disjoint solid barriers to travel, distance is measured by a shortest connecting rectilinear-length path not meeting the interior of any barrier. A point is sought minimising a convex nondecreasing function of its distances to a given finite fixed point set. The paper describes how to enlarge the barriers and add new ones without loss of optimality, thereby maximally reducing the feasible region. An actual solution procedure is described in the companion paper [ibid. 111, 111--133 (2002; Zbl 1041.90027)].
0 references
single facility location
0 references
rectilinear distance
0 references
barrier
0 references