## A Reduction Result for Planar Location Problems with Polygonal Barriers

• In this paper we consider the problem of locating one new facility in the plane with respect to a given set of existing facility where a set of polygonal barriers restricts traveling. This non-convex optimization problem can be reduced to a finite set of convex subproblems if the objective function is a convex function of the travel distances between the new and the existing facilities (like e.g. the Median and Center objective functions). An exact Algorithm and a heuristic solution procedure based on this reduction result are developed.

Author: Kathrin Klamroth urn:nbn:de:hbz:386-kluedo-4854 Report in Wirtschaftsmathematik (WIMA Report) (42) Preprint English 1999 1999 Technische Universität Kaiserslautern 2000/04/03 location; non-convex optimization Fachbereich Mathematik 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$