A qubit-efficient colored-permutation encoding for CVRP enables Constraint-Enhanced QAOA to recover verified optimal solutions on benchmarks without additional capacity qubits.
Mathematical Progra mming 183(1), 483– 523 (Sep 2020)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
RECORD introduces multiplicity reduction, on-the-fly aggregation, refined dominance fixing, and a new divisibility bound to outperform COMBO and BOUKNAP by orders of magnitude on hard KP and BKP benchmark instances.
A Grover-search-based quantum model for CVRPTW that encodes constraints with only linear additional decision qubits relative to TSP formulations.
citing papers explorer
-
Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
A qubit-efficient colored-permutation encoding for CVRP enables Constraint-Enhanced QAOA to recover verified optimal solutions on benchmarks without additional capacity qubits.
-
Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
RECORD introduces multiplicity reduction, on-the-fly aggregation, refined dominance fixing, and a new divisibility bound to outperform COMBO and BOUKNAP by orders of magnitude on hard KP and BKP benchmark instances.
-
Quantum Model for CVRPTW
A Grover-search-based quantum model for CVRPTW that encodes constraints with only linear additional decision qubits relative to TSP formulations.