scientific article; zbMATH DE number 1253061
From MaRDI portal
Publication:4229629
Recommendations
- Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- A unified model for Weber problems with continuous and network distances
- A generalized Weiszfeld method for the multi-facility location problem
- Probabilistic \(l_ p\) distances in location models
- General models in min-max continuous location: Theory and solution techniques
- Kantorovich-Rubinstein distance minimization: application to location problems
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
Cited in
(16)- Convex ordered median problem with \(\ell _p\)-norms
- Solving probabilistic multi-facility Weber problem by vector quantization
- Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- Accelerating convergence in the Fermat-Weber location problem
- Location and layout planning. A survey
- A generalization of the rectangular bounding method for continuous location models
- Application of decision analysis techniques to the Weber facility location problem
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
- Minisum location in space with restriction to curves and surfaces
- Accelerating convergence in minisum location problem with \(\ell p\) norms
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
- scientific article; zbMATH DE number 1138441 (Why is no real title available?)
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- On solving the planar k-centrum problem with Euclidean distances
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229629)
