Solving the Traveling Telescope Problem with Mixed-integer Linear Programming

The size and complexity of modern astronomical surveys has grown to the point where, in many cases, traditional human scheduling of observations are tedious at best and impractical at worst. Automated scheduling algorithms present an opportunity to save human effort and increase scientific productiv...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The Astronomical journal Jg. 167; H. 1; S. 33 - 47
Hauptverfasser:	Handley, Luke B., Petigura, Erik A., Mišić, Velibor V.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Madison The American Astronomical Society 01.01.2024 IOP Publishing
Schlagworte:	Algorithms Astronomical methods Celestial bodies Heuristic methods Integer programming Linear programming Mixed integer Observational astronomy Schedules Scheduling Sky surveys (astronomy) Workstations
ISSN:	0004-6256, 1538-3881
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!