Continuous approximation formulas for location problems
Abstract
The majority of research in the continuous approximation paradigm has emphasized routing problems, such as the travelling salesman problem and the vehicle routing problem. This article instead focuses on continuous approximation formulas for problems involving location, specifically the ‐medians, ‐dispersion, and generalized minimum spanning tree problems. We contribute bounds for constants that describe the growth rate of the cost of these problems as the number of demand points becomes large, and conduct computational experiments that verify that they provide a good approximation in practice.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Apr 29, 2022
- Source ID
- 10.1002/net.22099
Entities
People
- Bo Jones
- John Gunnar Carlsson
Organizations
- National Science Foundation of Sri Lanka
- Office of Naval Research
- United States Department of Transportation
- University of Southern California