Cost-efficient scheduling of FAST observations
Authors:
- 16 February 2018
- journal article
- research article
- Published by Springer Nature in Experimental Astronomy
- Vol. 45 (1) , 107-126
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61402325)
- Joint Research Fund in Astronomy under cooperative agreement between the National Natural Science Foundation of China (NSFC) and Chinese Academy of Sciences (U1531111, U1731125)
- Joint Research Fund in Astronomy under cooperative agreement between the National Natural Science Foundation of China (NSFC) and Chinese Academy of Sciences (U1531111, U1731125)
This publication has 16 references indexed in Scilit:
- The biggest earScience, 2016
- Artificial intelligence for the EChO mission planning toolExperimental Astronomy, 2014
- Weather forecasting and dynamic scheduling for a modern cm/mm wave radiotelescopeExperimental Astronomy, 2013
- Graph Algorithms2011
- THE FIVE-HUNDRED-METER APERTURE SPHERICAL RADIO TELESCOPE (FAST) PROJECTInternational Journal of Modern Physics D, 2011
- Spike: AI scheduling for NASA's Hubble Space Telescope2002
- A polynomial time primal network simplex algorithm for minimum cost flowsMathematical Programming, 1997
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Reducibility among Combinatorial Problems1972
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation ProblemsManagement Science, 1967