The Keplerian TSP models time-dependent interplanetary rendezvous missions as a discrete optimization problem using time-unfolding and ILP solvers, with released benchmarks and heuristics.
The Traveling-Salesman Problem.Operations research, 4(1):61–75
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Keplerian Traveling Salesperson Problem
The Keplerian TSP models time-dependent interplanetary rendezvous missions as a discrete optimization problem using time-unfolding and ILP solvers, with released benchmarks and heuristics.