The weighted Euclidean 1-center problem

DOI10.1016/0167-6377(82)90009-8zbMath0487.90048OpenAlexW2003991987MaRDI QIDQ1165764

R. Chandrasekaran

Publication date: 1982

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(82)90009-8

zbMATH Keywords

minimizationpolynomial algorithmlinear constraintslocal problemratio of convex quadratic and an affine function over a polyhedral setweighted Euclidean 1-center problem

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (9)

On the complexity of some geometric problems in unbounded dimension ⋮ The extensive 1-median problem with radius on networks ⋮ Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I. ⋮ Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II. ⋮ Geometric problems in automated manufacturing. ⋮ A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes ⋮ Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem ⋮ On the ball spanned by balls ⋮ Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games

Cites Work

• Unnamed Item
• Weighted min-max location problems: Polynomially bounded algorithms
• The Weighted Euclidean 1-Center Problem

This page was built for publication: The weighted Euclidean 1-center problem