A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
From MaRDI portal
Cited in
(17)- The impact of distance on location problems
- Normative location theory: Placement in continuous space
- The Weber problem with regional demand
- Semi-obnoxious single facility location in Euclidean space.
- The convergence of the Weiszfeld algorithm
- A generalization of the rectangular bounding method for continuous location models
- A two-echelon joint continuous-discrete location model
- Imprecise weights in Weber facility location problem
- Single facility siting involving allocation decisions
- Weber's problem and weiszfeld's algorithm in general spaces
- Effective algorithm for the weber problem with a rectangular metric
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- Solving quadratic assignment problems with rectangular distances and integer programming
- A projected Weiszfeld algorithm for the box-constrained Weber location problem
- Duality in constrained multi‐facility location models
- Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem
- Duality for constrained multifacility location problems with mixed norms and applications
This page was built for publication: A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5650527)
