Exhaustively parametrised feasibility-respecting quantum circuits can reach every feasible solution to problems like TSP with certainty using fixed parameters by leveraging group actions and generating sequences.
Solution of a Large-Scale Traveling-Salesman Problem
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
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.
citing papers explorer
-
Exhaustive and feasible parametrisation with applications to the travelling salesperson problem
Exhaustively parametrised feasibility-respecting quantum circuits can reach every feasible solution to problems like TSP with certainty using fixed parameters by leveraging group actions and generating sequences.
-
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.