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

Full description

Bibliographic Details

Published in:	The Astronomical journal Vol. 167; no. 1; pp. 33 - 47
Main Authors:	Handley, Luke B., Petigura, Erik A., Mišić, Velibor V.
Format:	Journal Article
Language:	English
Published:	Madison The American Astronomical Society 01.01.2024 IOP Publishing
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!