Author:
Gonçalves Felipe,Ramos João P. G.
Abstract
AbstractIn this note we develop a linear programming framework to produce upper and lower bounds for the lonely runner problem.
Funder
Rheinische Friedrich-Wilhelms-Universität Bonn
Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. Bohman, T., Holzman, R., Kleitman, D.: Six lonely runners, In honor of Aviezri Fraenkel on the occasion of his 70th birthday. Electron. J. Combin. 8(2), 49 (2001)
2. Cusick, T.W.: View obstruction problems. Aequat. Math. 9, 165–170 (1973)
3. Goddyn, L., Wong, E.B.: Tight instances of the lonely runner. Integers 6, A38 (2006)
4. Gurobi Optimization, LLC, Gurobi Optimizer Reference Manual (2020)
5. Montgomery, H.L.: Ten lectures on the interface between analytic number theory and harmonic analysis. CBMS Regional Conference Series in Mathematics 84 (1994)