Premium
Restricted planar location problems and applications
Author(s) -
Hamacher H. W.,
Nickel S.
Publication year - 1995
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199509)42:6<967::aid-nav3220420608>3.0.co;2-x
Subject(s) - facility location problem , disjoint sets , computer science , regular polygon , set (abstract data type) , planar , plane (geometry) , pairwise comparison , mathematical optimization , center (category theory) , 1 center problem , operations research , mathematics , combinatorics , artificial intelligence , geometry , programming language , computer graphics (images) , chemistry , crystallography
Facility location problems in the plane are among the most widely used tools of Mathematical Programming in modeling real‐world problems. In many of these problems restrictions have to be considered which correspond to regions in which a placement of new locations is forbidden. We consider center and median problems where the forbidden set is a union of pairwise disjoint convex sets. As applications we discuss the assembly of printed circuit boards, obnoxious facility location and the location of emergency facilities. © 1995 John Wiley & Sons, Inc.