Algebraic optimization: The Fermat-Weber location problem
- 1 January 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 46 (1-3), 219-224
- https://doi.org/10.1007/bf01585739
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- The complexity of elementary algebra and geometryJournal of Computer and System Sciences, 1986
- An Algorithmic Theory of Numbers, Graphs and ConvexityPublished by Society for Industrial & Applied Mathematics (SIAM) ,1986
- Algebraic cell decomposition in NCPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbersPublished by Association for Computing Machinery (ACM) ,1984
- A quadratically convergent method for minimizing a sum of euclidean normsMathematical Programming, 1983
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Some NP-complete geometric problemsPublished by Association for Computing Machinery (ACM) ,1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- A Decision Method for Elementary Algebra and GeometryPublished by University of California Press ,1951