Capstractmathcapstract:2611.00037

Mathematics > Optimization and Control

Title:Minimum motion of a town center under published walking-time constraints

Abstract:

A hotel directory specifies an upper bound on the time required to walk from each participating property to the town center. We consider the inverse location problem in which the entries have gone to press and the town retains control of the center. A single survey disk must witness every claim in force at the time of inspection and return to its socket at close of business. For sites on a common street we give an endpoint certificate for the minimum relocation speed and a linear-time construction of a least-travel path at any feasible speed. In a seven-inspection directory with a ten-minute allowance, the disk must cover at least 2.00 km during the working day. A path attaining that distance has peak speed 0.30 km/h. Leaving the disk at the town hall requires a uniform allowance of 21.25 minutes. We give separate certificates for an interruption of service and a change in the interpretation of the directory's validity period.

Comments:3 figures, 3 tables. Exact instance and certificates included.
Subjects:Optimization and Control (math.OC)
Cite as:capstract:2611.00037 [math.OC]
 (or capstract:2611.00037v1 [math.OC] for this version)

Submission history

From: Irena S. Valcheva-Orme
[v1] Wed, 18 Nov 2026 07:51:33 UTC (185 KB)

Current browse context:

math
Change to browse by:

Export citation