Planar expropriation problem with non-rigid rectangular facilities

DOI10.1016/J.COR.2010.01.008MaRDI QIDQ709112zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

branch-and-boundlocation analysisaspect ratiomixed 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)

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

Cites work

• scientific article; zbMATH DE number 1803755 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 1253058 (Why is no real title available?)
• scientific article; zbMATH DE number 1340521 (Why is no real title available?)
• scientific article; zbMATH DE number 1079755 (Why is no real title available?)
• scientific article; zbMATH DE number 1138438 (Why is no real title available?)
• scientific article; zbMATH DE number 1559403 (Why is no real title available?)
• A Maxmin Location Problem
• A Parametric 1-Maximin Location Problem
• A mixed integer formulation for maximal covering by inclined parallelograms
• A multi-facility location model with partial satisfaction of demand
• An Enhancement of the Drezner-Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Analytical models for locating undesirable facilities
• Computing largest empty circles with location constraints
• Computing the width of a set
• Covering points with a polygon
• Determining an optimum location for an undesirable facility in a workroom environment
• Efficient location for a semi-obnoxious facility
• Euclidean push--pull partial covering problems
• Geometric complexity of some location problems
• 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
• Sequential location problems
• The expropriation location problem
• Undesirable facility location with minimal covering objectives

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

Describes a project that uses

Uses Software

• SBB
• BARON

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)