Graph explorer

The FedEx problem

The original shipping strategy of FedEx is to fly all packages to a hub location during the afternoon and evening, sort them there, and then fly them to their destinations during the night for delivery the next day. This leads to interesting mathematical questions: Given a population represented by points in Euclidean space or on a sphere, what is the location of the point of the hub that minimizes the total distance to all the points? Is such a point unique? Then using census data from 2000 we examine how close the FedEx hub in Memphis is to the hub for the U.S. population.

5 nodes4 linksoverview mapThe FedEx problem
5 nodes4 links
The FedEx problem5 visible / 5 total nodes / 4 links
AuthorshipTopic signalTopic signalTopic signalWThe FedEx problempreprint / 2014AKent E. MorrisonResearcherTmath.PR7239 worksTmath.MG1407 worksTmath.HO497 works
PaperSignal 104 links

The FedEx problem

preprint / 2014

Open