Planar expropriation problem with non-rigid rectangular facilities
DOI10.1016/J.COR.2010.01.008zbMATH Open1231.90273OpenAlexW1987203135MaRDI QIDQ709112FDOQ709112
Authors: Ozan Çakır, George O. Wesolowsky 
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
Recommendations
- The expropriation location problem
- Locating semi-obnoxious facilities with expropriation: minisum criterion
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- Efficient models for the facility layout problem
- An extended continuous maximal covering location problem with facility placement
branch-and-boundlocation analysisaspect ratiomixed integer non-linear programmingcontinuous facility locationexpropriation location problemminimal covering location problemnon-rigid facilitiesnoxious facility location problem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing largest empty circles with location constraints
- Analytical models for locating undesirable facilities
- Title not available (Why is that?)
- Efficient location for a semi-obnoxious facility
- Determining an optimum location for an undesirable facility in a workroom environment
- Sequential location problems
- A mixed integer formulation for maximal covering by inclined parallelograms
- A Maxmin Location Problem
- The expropriation location problem
- Covering points with a polygon
- Geometric complexity of some location problems
- Computing the width of a set
- Euclidean push--pull partial covering problems
- A multi-facility location model with partial satisfaction of demand
- Title not available (Why is that?)
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- An Enhancement of the Drezner-Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance
- Is Linear Programming Necessary for Single Facility Location with Maximin of Rectilinear Distance?
- Location of an undesirable facility in a polygonal region with forbidden zones
- Undesirable facility location with minimal covering objectives
- Title not available (Why is that?)
- A Parametric 1-Maximin Location Problem
Cited In (5)
- Fuzzy covering location problems with different aggregation operators
- 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
- The expropriation location problem
- The board packing problem
Uses Software
This page was built for publication: Planar expropriation problem with non-rigid rectangular facilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709112)
