Minisum location problem with farthest Euclidean distances

DOI10.1007/s00186-006-0084-2zbMath1132.90344MaRDI QIDQ857948

Jian-lin 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 test; choice of starting point; constrained Weber problem; fixed region; greedy choice

Mathematics Subject Classification ID

90B80: Discrete location and assignment

Related Items

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, Planning a capacitated road network with flexible travel times: a genetic algorithm, A minisum location problem with regional demand considering farthest Euclidean distances

Cites Work

• Unnamed Item
• Unnamed Item
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• The Weber problem with regional demand
• Minisum location with closest Euclidean distances
• An Algorithm for a Constrained Weber Problem
• Location of regional facilities
• Solutions of Constrained Location Problems
• Engineering and Economic Applications of Complementarity Problems
• The generalized Weber problem with expected distances
• Location of facilities with rectangular distances among point and area destinations
• An Approach to Location Models Involving Sets as Existing Facilities
• Locating facilities by minimax relative to closest points of demand areas