On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies
| Autor: | Panagiotis Tsiotras, Atri Dutta, Sofie Coene, Frits C. R. Spieksma |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
020301 aerospace & aeronautics
Mathematical optimization Computational complexity theory Computer science 02 engineering and technology Peer-to-peer Solver computer.software_genre 01 natural sciences Computer Science Applications 0203 mechanical engineering 0103 physical sciences Signal Processing Satellite Special case 010303 astronomy & astrophysics Assignment problem computer Integer programming Generalized assignment problem Information Systems |
| Zdroj: | INFOR: Information Systems and Operational Research. 50:88-94 |
| ISSN: | 1916-0615 0315-5986 |
| DOI: | 10.3138/infor.50.2.088 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|