Multiple obnoxious facility location: the case of protected areas

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
Tools of mathematical modeling of arbitrary object packing problems
A multiobjective model for locating undesirable facilities
Planar location problems with block distance and barriers
An efficient solution method for Weber problems with barriers based on genetic algorithms
The rectilinear distance Weber problem in the presence of a probabilistic line barrier
Locating an undesirable facility with a minimax criterion
Analytical models for locating undesirable facilities
An efficient algorithm for facility location in the presence of forbidden regions
Location of an undesirable facility in a polygonal region with forbidden zones
A note on center problems with forbidden polyhedra
Efficient location for a semi-obnoxious facility
Semi-obnoxious single facility location in Euclidean space.
Planar Weber location problems with barriers and block norms
Multicommodity flows and Benders decomposition for restricted continuous location problems
Undesirable facility location with minimal covering objectives
Constrained location of competitive facilities in the plane
A continuous location model for siting a non-noxious undesirable facility within a geographical region
Conditional facility location problems with continuous demand and a polygonal barrier
Locating a semi-obnoxious covering facility with repelling polygonal regions
Review of obnoxious facilities location problems
Locating an undesirable facility by generalized cutting planes.
Finite-Size Facility Placement in the Presence of Barriers to Rectilinear Travel
Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
The expropriation location problem
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
A reduction result for location problems with polyhedral barriers