Bounds for the Lonely Runner Problem via Linear Programming
arXiv:2010.02271
Abstract
In this note we develop a linear programming framework to produce upper and lower bounds for the lonely runner problem.
arXiv comment6 pages, 1 figure; plot was fixed and improved, acknowledgements added