Planar expropriation problem with non-rigid rectangular facilities

DOI10.1016/j.cor.2010.01.008zbMath1231.90273OpenAlexW1987203135MaRDI 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

zbMATH Keywords

branch-and-boundaspect ratiolocation analysismixed integer non-linear programmingcontinuous facility locationexpropriation location problemminimal covering location problemnon-rigid facilitiesnoxious facility location problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85)

Related Items (4)

A cutting plane algorithm for the site layout planning problem with travel barriers ⋮ The board packing problem ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ Fuzzy covering location problems with different aggregation operators

Uses Software

• BARON
• SBB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Planar expropriation problem with non-rigid rectangular facilities