Abstract
We revisit the peer-to-peer on-orbit satellite refueling problem, in which the maneuvering satellites are allowed to interchange their orbital positions. We show that the problem is computationally hard by reducing it to a special case of the three-index assignment problem. On the positive side, we show that the size of instances in practice is such that a state-of-the-art integer programming solver is able to find globally optimal solutions in little computing time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: INFOR: Information Systems and Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
