Heuristics for a continuous multi-facility location problem with demand regions
DOI10.1016/J.COR.2014.09.001zbMATH Open1348.90431OpenAlexW2038354247MaRDI QIDQ337660FDOQ337660
Authors: Derya Dinler, Mustafa Kemal Tural, Cem Iyigun 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://etd.lib.metu.edu.tr/upload/12616644/index.pdf
Recommendations
- A minisum location problem with regional demand considering farthest Euclidean distances
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
- Location of regional facilities
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
second order cone programmingfacility location problemshyperbolic smoothingminimum sum of squares clustering
Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)
Cites Work
- Solving semidefinite-quadratic-linear programs using SDPT3
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applications of second-order cone programming
- Second-order cone programming
- The p-center location problem in an area
- Heuristic Methods for Location-Allocation Problems
- Title not available (Why is that?)
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- On the Complexity of Some Common Geometric Location Problems
- The hyperbolic smoothing clustering method
- The Weber problem with regional demand
- A heuristic method for large-scale multi-facility location problems
- Minisum location with closest Euclidean distances
- Numbers and functions. From a classical-experimental mathematician's point of view
- Generalized Weber Problem with Rectangular Regions
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- The generalized Weber problem with expected distances
- Location Models With Groups Of Demand Points
- Locating facilities by minimax relative to closest points of demand areas
- Minisum location problem with farthest Euclidean distances
Cited In (8)
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- Location of regional facilities
- A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- A minisum location problem with regional demand considering farthest Euclidean distances
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
- Facility location problems on graphs with non-convex neighborhoods
Uses Software
This page was built for publication: Heuristics for a continuous multi-facility location problem with demand regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337660)
