Bounds for the Lonely Runner Problem via Linear Programming
Felipe Gon\c{c}alves, Jo\~ao P. G. Ramos
TL;DR
This paper introduces a linear programming approach to establish bounds for the lonely runner problem, providing a new mathematical framework to analyze this classic problem in recreational mathematics.
Contribution
The paper develops a linear programming framework to derive upper and lower bounds for the lonely runner problem, offering a novel analytical tool.
Findings
Derived new bounds for the lonely runner problem
Established a linear programming framework for analysis
Provided insights into the problem's constraints
Abstract
In this note we develop a linear programming framework to produce upper and lower bounds for the lonely runner problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Vehicle Routing Optimization Methods