Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances

DOI10.1007/S10589-019-00163-0MaRDI QIDQ2301150zbMATH OpenOpenAlexWikidataFDO

Authors Nazlı Dolu, Umur Hastürk, Mustafa Kemal Tural

Publication date 28 February 2020

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-019-00163-0

zbMATH Keywords

facility locationmin-max problemMinkowski sumregional customersecond order cone programming

Mathematics Subject Classification ID

Continuous location (90B85) Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47)

Recommendations

• A minisum location problem with regional demand considering farthest Euclidean distances
• Minisum location with closest Euclidean distances
• The single facility location problem with minimum distance constraints
• Minisum location problem with farthest Euclidean distances
• Minimax location with farthest Euclidean distances

Cites work

• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
• A minisum location problem with regional demand considering farthest Euclidean distances
• Algorithms for Reporting and Counting Geometric Intersections
• An Approach to Location Models Involving Sets as Existing Facilities
• An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
• Applications of second-order cone programming
• Automated Reasoning
• Continuous multifacility ordered median location problems
• Generalized Weber Problem with Rectangular Regions
• Heuristics for a continuous multi-facility location problem with demand regions
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 1423921 (Why is no real title available?)
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Locating facilities by minimax relative to closest points of demand areas
• Location and shape of a rectangular facility in \(\mathbb{R}^n\). Convexity properties
• Location Models With Groups Of Demand Points
• Location of facilities with rectangular distances among point and area destinations
• Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
• Minisum location problem with farthest Euclidean distances
• Minisum location with closest Euclidean distances
• Mixed integer linear programming formulation techniques
• Modelling with integer variables
• New Results on the Complexity of p-Centre Problems
• On the exact maximum complexity of Minkowski sums of polytopes
• On the structure of the solution set for the single facility location problem with average distances
• Ordered \(p\)-median problems with neighbourhoods
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
• Second-order cone programming
• Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
• The generalized Weber problem with expected distances
• The Weighted Euclidean 1-Center Problem
• Weber problems with mixed distances and regional demand

Cited in

(3)

• A minisum location problem with regional demand considering farthest Euclidean distances
• Facility location problems on graphs with non-convex neighborhoods
• Multi-type maximal covering location problems: hybridizing discrete and continuous problems

Describes a project that uses

Uses Software

• Isabelle/HOL

This page was built for publication: Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301150)