A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
From MaRDI portal
Publication:5650527
DOI10.1287/mnsc.18.11.656zbMath0238.90059OpenAlexW2058653107MaRDI QIDQ5650527
Love, Robert F., George O. Wesolowsky
Publication date: 1972
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.18.11.656
Related Items (16)
Imprecise weights in Weber facility location problem ⋮ Duality in constrained multi‐facility location models ⋮ Single facility siting involving allocation decisions ⋮ A two-echelon joint continuous-discrete location model ⋮ Hyperbolic smoothing and penalty techniques applied to molecular structure determination ⋮ The impact of distance on location problems ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ Semi-obnoxious single facility location in Euclidean space. ⋮ Duality for constrained multifacility location problems with mixed norms and applications ⋮ Solving quadratic assignment problems with rectangular distances and integer programming ⋮ Normative location theory: Placement in continuous space ⋮ Weber's problem and weiszfeld's algorithm in general spaces ⋮ Effective algorithm for the weber problem with a rectangular metric ⋮ The Weber problem with regional demand ⋮ The convergence of the Weiszfeld algorithm ⋮ A generalization of the rectangular bounding method for continuous location models
This page was built for publication: A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
