2013/11/19 by M. C. López-de-los-Mozos, López-de-los-Mozos, M. C., Juan A. Mesa +3
Business, Management and Accounting · Computer Science · Engineering · Mathematics · #90B85 #Computational Geometry and Mesh Generation #Evacuation and Crowd Dynamics #FOS: Mathematics #Facility Location and Emergency Management #Optimization and Control (math.OC) #math.OC #msc:90B85
paper · pdf · doi:10.48550/arxiv.1311.4837
16 pages, 4 figures
arxiv created 2013/11/19 · openalex publication_date 2013/11/19 · arxiv updated 2013/11/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we consider a set of origin-destination pairs in a mixed model in which a network embedded in the plane represents an alternative high-speed transportation system, and study a trip covering problem which consists on locating two points in the network which maximize the number of covered pairs, that is, the number of pairs which use the network by acceding and exiting through such points.