Restricted planar location problems and applications

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. The authors consider center and median problems where the forbidden set is a union of pairwise disjoint convex sets. As applications they discuss the assembly of printed circuit boards, obnoxious facility location and the location of emergency facilities.