On the computational complexity of peer-to-peer satellite refueling strategies

S. Coene, F.C.R. Spieksma, A. Dutta, P. Tsiotras

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)88-94
JournalINFOR : Information Systems and Operational Research
Issue number2
Publication statusPublished - May 2012
Externally publishedYes


  • On-orbit satellite refueling
  • three-index assignment problem
  • computational complexity
  • integer programming


Dive into the research topics of 'On the computational complexity of peer-to-peer satellite refueling strategies'. Together they form a unique fingerprint.

Cite this