Averaging the k largest distances among n: k-centra in Banach spaces
DOI10.1016/J.JMAA.2003.11.011zbMATH Open1065.46014OpenAlexW1974124149WikidataQ58217307 ScholiaQ58217307MaRDI QIDQ1433355FDOQ1433355
Justo Puerto, Pier Luigi Papini
Publication date: 15 June 2004
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2003.11.011
Geometry and structure of normed linear spaces (46B20) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Location Theory, Dominance, and Convexity
- The \(k\)-centrum multi-facility location problem
- A flexible approach to location problems
- Minimizing the sum of the \(k\) largest functions in linear time.
- A Banach space in which all compact sets, but not all bounded sets, admit Chebyshev centers
- Geometrical properties of the symmetrical single facility location problem
- Centroids, centers, medians: What is the difference?
- Centers to centroids in graphs
- Circumspheres and Inner Products.
- Location of the Fermat-Torricelli medians of three points
- Constrained and unconstrained problems in location theory and inner products
- Minimax parametric optimization problems and multi-dimensional parametric searching
- On some constants in Banach spaces
- Distances to the two and three furthest points
Cited In (3)
This page was built for publication: Averaging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433355)
