On the location of the minimum point in the Euclidean distance sum problem
DOI10.1007/S40863-017-0061-0zbMATH Open1396.52017OpenAlexW2726506814WikidataQ108075139 ScholiaQ108075139MaRDI QIDQ723341FDOQ723341
Authors: Luis Fernando Mello, Lucas Ruiz dos Santos
Publication date: 31 July 2018
Published in: São Paulo Journal of Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40863-017-0061-0
Recommendations
- Minisum location with closest Euclidean distances
- On the point for which the sum of the distances to \(n\) given points is minimum
- Minisum location in space with restriction to curves and surfaces
- Minsum location extended to gauges and to convex sets
- A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE A-DISTANCE
convex functiondistance functionfocal pointEuclidean distance-sum problemgeneralized ellipseminimum point
Calculus of vector functions (26B12) Convexity of real functions of several variables, generalizations (26B25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Convex functions and convex programs in convex geometry (52A41)
Cites Work
Cited In (7)
- Solving a generalized Heron problem by means of convex analysis
- Title not available (Why is that?)
- Remarks on Euclidean minima
- On minimizing distance by the road less traveled
- On the point for which the sum of the distances to \(n\) given points is minimum
- Minisum location problem with farthest Euclidean distances
- Minisum location with closest Euclidean distances
This page was built for publication: On the location of the minimum point in the Euclidean distance sum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723341)