Solving rectilinear planar location problems with barriers by a polynomial partitioning (Q1872030): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q816412
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / author
 
Property / author: R. Segars jun. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 05:01, 5 March 2024

scientific article
Language Label Description Also known as
English
Solving rectilinear planar location problems with barriers by a polynomial partitioning
scientific article

    Statements

    Solving rectilinear planar location problems with barriers by a polynomial partitioning (English)
    0 references
    0 references
    0 references
    4 May 2003
    0 references
    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.
    0 references
    single facility location
    0 references
    rectilinear distance
    0 references
    barrier
    0 references

    Identifiers