Minisum location problem with farthest Euclidean distances

DOI10.1007/S00186-006-0084-2MaRDI QIDQ857948zbMATH OpenOpenAlexFDO

Authors Jianlin Jiang, Ya Xu

Publication date 5 January 2007

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-006-0084-2

zbMATH Keywords

bound testchoice of starting pointconstrained Weber problemfixed regiongreedy choice

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Minimax location with farthest Euclidean distances
• Minisum location with closest Euclidean distances
• On the location of the minimum point in the Euclidean distance sum problem
• MINIMAX LOCATION PROBLEM WITH A-DISTANCE
• A minisum location problem with regional demand considering farthest Euclidean distances
• The Solution of Distance Constrained Mini-Sum Location Problems
• Stochastic multi-facility minisum location problem involving Euclidean distances
• A new algorithm for the minimax location problem with the closest distance
• A squared-euclidean distance location-allocation problem
• The rectilinear distance minisum problem with minimum distance constraints:

Cites work

• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• An Algorithm for a Constrained Weber Problem
• An Approach to Location Models Involving Sets as Existing Facilities
• Engineering and Economic Applications of Complementarity Problems
• scientific article; zbMATH DE number 844464 (Why is no real title available?)
• scientific article; zbMATH DE number 1423921 (Why is no real title available?)
• Locating facilities by minimax relative to closest points of demand areas
• Location of facilities with rectangular distances among point and area destinations
• Location of regional facilities
• Minisum location with closest Euclidean distances
• Solutions of Constrained Location Problems
• The generalized Weber problem with expected distances
• The Weber problem with regional demand

Cited in

(11)

• A maximum \(L_p\) distance problem
• Minisum location with closest Euclidean distances
• Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
• A minisum location problem with regional demand considering farthest Euclidean distances
• Heuristics for a continuous multi-facility location problem with demand regions
• A squared-euclidean distance location-allocation problem
• Accelerating the convergence in the single-source and multi-source Weber problems
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
• MINIMAX LOCATION PROBLEM WITH A-DISTANCE
• Minimax location with farthest Euclidean distances
• Planning a capacitated road network with flexible travel times: a genetic algorithm

This page was built for publication: Minisum location problem with farthest Euclidean distances

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