The optimal solution set of the multi-source Weber problem

DOI10.1007/s41980-018-0145-3zbMath1411.90059OpenAlexW2820808334MaRDI QIDQ2414188

Ahmadreza Raeisi Dehkordi

Publication date: 10 May 2019

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-018-0145-3

zbMATH Keywords

subdifferentiallocationmulti-source Weber problem

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Transportation, logistics and supply chain management (90B06) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items (3)

A new algorithm for the minimax location problem with the closest distance ⋮ On the convergence of the Cooper's algorithm ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms

Cites Work

• Unnamed Item
• On Newton's method for the Fermat-Weber location problem
• Algebraic optimization: The Fermat-Weber location problem
• A guided reactive GRASP for the capacitated multi-source Weber problem
• On the point for which the sum of the distances to \(n\) given points is minimum
• An optimal method for solving the (generalized) multi-Weber problem
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
• Time bounds for selection
• A cellular heuristic for the multisource Weber problem.
• A heuristic method for large-scale multi-facility location problems
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• Weiszfeld's method: old and new results
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
• A quadratically convergent method for minimizing a sum of euclidean norms
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• Local convergence in Fermat's problem
• A subgradient algorithm for certain minimax and minisum problems
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• Heuristic Methods for Location-Allocation Problems
• Convex Analysis
• A note on Fermat's problem
• Combinatorial optimization. Theory and algorithms.
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• Locating facilities by minimax relative to closest points of demand areas

This page was built for publication: The optimal solution set of the multi-source Weber problem