A polynomial time algorithm for solving the fermat-weber location problem with mixed norms

DOI10.1080/02331939408843986zbMath0837.90079OpenAlexW1976977488MaRDI QIDQ4764869

Shiquan Wu

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843986

zbMATH Keywords

subgradientFermat-Weber location problemmixed normsellipsoid method

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

Related Items (2)

Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions

This page was built for publication: A polynomial time algorithm for solving the fermat-weber location problem with mixed norms