The weighted euclidean 1-center problem

Authors:
R. Chandrasekaran
Affiliations:
School of Management and Administration, The University of Texas at Dallas, P.O. Box 688, Richardson, TX 75080, U.S.A.
Venue:
Operations Research Letters
Year:
1982

Citing 1
Cited 3

Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science

On the complexity of some geometric problems in unbounded dimension

Journal of Symbolic Computation
Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part I)

Computational Geometry: Theory and Applications
Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part II)

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a polynomial algorithm for the weighted 1-center problem (indeed minimization of the ratio of convex quadratic and an affine function over a polyhedral set). In the location problem, the complexity is polynomial in the dimension of the space.