The weighted Euclidean 1-center problem

DOI10.1016/0167-6377(82)90009-8MaRDI QIDQ1165764zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3677572 (Why is no real title available?)
• The Weighted Euclidean 1-Center Problem
• Weighted min-max location problems: Polynomially bounded algorithms

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165764)