Abstract
One of the most common strategies used in large-scale logistics problems is districting, in which one divides a service region into smaller pieces. This is particularly useful when one does not know the true locations of demand, but has only limited information such as a probability distribution or a small set of sample data. In “Wasserstein Distance and the Distributionally Robust TSP,” Carlsson et al. show how to partition a region so as to balance the traveling salesman tours of a set of unknown points, using a distributionally robust method defined by a bound on the Wasserstein distance to a set of landmark points.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
