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.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
DeQL is a SQL extension for decision queries that define candidate options from relations and declare variables, constraints, and objectives to compute optimal actions.
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.
-
DeQL: A Decision Query Language for Prescriptive Analytics over Relational Data
DeQL is a SQL extension for decision queries that define candidate options from relations and declare variables, constraints, and objectives to compute optimal actions.
-
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.