Bounds for the Lonely Runner Problems Via Linear Programming

Bounds for the Lonely Runner Problems Via Linear Programming

In this note we develop a linear programming framework to produce upper and lower bounds for the lonely runner problem.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Boletim da Sociedade Brasileira de Matemática 2022-06, Vol.53 (2), p.595-603
Hauptverfasser: Gonçalves, Felipe, Ramos, João P. G.
Format: Artikel
Sprache:eng
Schlagworte:
Linear programming
Lower bounds
Mathematical and Computational Physics
Mathematics
Mathematics and Statistics
Theoretical
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this note we develop a linear programming framework to produce upper and lower bounds for the lonely runner problem.
ISSN:1678-7544
1678-7714
DOI:10.1007/s00574-021-00272-7