On the location of the minimum point in the Euclidean distance sum problem

DOI10.1007/S40863-017-0061-0zbMath1396.52017OpenAlexW2726506814WikidataQ108075139 ScholiaQ108075139MaRDI QIDQ723341

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

zbMATH Keywords

convex functionfocal pointdistance functionminimum pointEuclidean distance-sum problemgeneralized ellipse

Mathematics Subject Classification ID

Convex functions and convex programs in convex geometry (52A41) Calculus of vector functions (26B12) Convexity of real functions of several variables, generalizations (26B25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Cites Work

• Unnamed Item
• On a lower and upper bound for the curvature of ellipses with more than two foci
• n-Ellipses and the Minimum Distance Sum Problem
• The FedEx Problem
• Four-point Fermat location problems revisited. New proofs and extensions of old results
• A note on Fermat's problem

This page was built for publication: On the location of the minimum point in the Euclidean distance sum problem