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...

Celý popis

Podrobná bibliografia

Vydané v:	The Astronomical journal Ročník 167; číslo 1; s. 33 - 47
Hlavní autori:	Handley, Luke B., Petigura, Erik A., Mišić, Velibor V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Madison The American Astronomical Society 01.01.2024 IOP Publishing
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!