A minisum location problem with regional demand considering farthest Euclidean distances

DOI10.1080/10556788.2015.1121486zbMath1344.90030OpenAlexW2340907186MaRDI QIDQ2815539

Derya Dinler, Mustafa Kemal Tural

Publication date: 29 June 2016

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2015.1121486

zbMATH Keywords

facility location problemsecond-order cone programmingminisum problemdemand region

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11) Continuous location (90B85)

Related Items (2)

A note on the formal implementation of the \(K\)-means algorithm with hard positive and negative constraints ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances

Cites Work

• Unnamed Item
• Heuristics for a continuous multi-facility location problem with demand regions
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
• On the structure of the solution set for the single facility location problem with average distances
• Minisum location problem with farthest Euclidean distances
• Applications of second-order cone programming
• The Weber problem with regional demand
• Second-order cone programming
• Minisum location with closest Euclidean distances
• Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
• Heuristic Methods for Location-Allocation Problems
• The generalized Weber problem with expected distances
• Minimization of unsmooth functionals
• An Approach to Location Models Involving Sets as Existing Facilities
• Optimal location of a single facility with circular demand areas
• Locating facilities by minimax relative to closest points of demand areas

This page was built for publication: A minisum location problem with regional demand considering farthest Euclidean distances