A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms
From MaRDI portal
Publication:3815102
DOI10.1051/ro/1988220403131zbMath0663.90026OpenAlexW2586805910MaRDI QIDQ3815102
O. Lefebvre, H. Idrissi, Christian Michelot
Publication date: 1988
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104946
location theorydecompositionoptimality conditionsparallel computationsmixed normsupdating rulesprimal- dual algorithmpartial inverse methodconstrained Fermat-Weber problem
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)
Related Items
A partial complement method for approximating solutions of a primal dual fixed-point problem ⋮ Duality for constrained multifacility location problems with mixed norms and applications ⋮ A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
