A generalized Weiszfeld method for the multi-facility location problem
From MaRDI portal
Recommendations
- ADMM-type methods for generalized multi-facility Weber problem
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
- Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
- A heuristic method for large-scale multi-facility location problems
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- An optimal method for solving the (generalized) multi-Weber problem
- An algorithm for a multicriteria optimization problem and its application to a facility location problem
Cites work
- scientific article; zbMATH DE number 1803754 (Why is no real title available?)
- scientific article; zbMATH DE number 5957421 (Why is no real title available?)
- scientific article; zbMATH DE number 3152611 (Why is no real title available?)
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1253040 (Why is no real title available?)
- scientific article; zbMATH DE number 3291744 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A heuristic method for large-scale multi-facility location problems
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- A note on Fermat's problem
- A note on the Weber location problem
- Contour approximation of data: a duality theory
- Further notes on convergence of the Weiszfeld algorithm
- Heuristic Methods for Location-Allocation Problems
- Iterative Minimization Schemes for Solving the Single Source Localization Problem
- On Information and Sufficiency
- On the Complexity of Some Common Geometric Location Problems
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE
- Probabilistic d-clustering
- Solving the multiple competitive facilities location problem
- The gravity \(p\)-median model
- Weber's problem and weiszfeld's algorithm in general spaces
Cited in
(26)- Solving \(k\)-center problems involving sets based on optimization techniques
- Backup multifacility location problem with \(l_p\) norm
- Multi-facility green Weber problem
- A generalization of the rectangular bounding method for continuous location models
- \(k\)-means, Ward and probabilistic distance-based clustering methods with contiguity constraint
- A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- One-dimensional center-based l 1-clustering method
- scientific article; zbMATH DE number 140518 (Why is no real title available?)
- A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities
- Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
- The planar hub location problem: a probabilistic clustering approach
- Internet shopping with price sensitive discounts
- Interpretation and optimization of the \(k\)-means algorithm.
- Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
- The generalized Fermat-Torricelli problem in Hilbert spaces
- scientific article; zbMATH DE number 1253061 (Why is no real title available?)
- Planning a capacitated road network with flexible travel times: a genetic algorithm
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- Weiszfeld's method: old and new results
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- Probabilistic d-clustering
- A PROBABILISTIC ℓ1 METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA
This page was built for publication: A generalized Weiszfeld method for the multi-facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974995)
