Planar expropriation problem with non-rigid rectangular facilities
From MaRDI portal
Publication:709112
DOI10.1016/j.cor.2010.01.008zbMath1231.90273MaRDI QIDQ709112
George O. Wesolowsky, Ozan Çakır
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.01.008
branch-and-bound; aspect ratio; location analysis; mixed integer non-linear programming; continuous facility location; expropriation location problem; minimal covering location problem; non-rigid facilities; noxious facility location problem
Related Items
Fuzzy covering location problems with different aggregation operators, The board packing problem, A cutting plane algorithm for the site layout planning problem with travel barriers, Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
Uses Software
Cites Work
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Determining an optimum location for an undesirable facility in a workroom environment
- Geometric complexity of some location problems
- Analytical models for locating undesirable facilities
- Sequential location problems
- Location of an undesirable facility in a polygonal region with forbidden zones
- Efficient location for a semi-obnoxious facility
- Undesirable facility location with minimal covering objectives
- A mixed integer formulation for maximal covering by inclined parallelograms
- Covering points with a polygon
- Euclidean push--pull partial covering problems
- Computing largest empty circles with location constraints
- An Enhancement of the Drezner-Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance
- Computing the width of a set
- A Maxmin Location Problem
- Is Linear Programming Necessary for Single Facility Location with Maximin of Rectilinear Distance?
- The expropriation location problem
- A Parametric 1-Maximin Location Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item