A qubit-efficient colored-permutation encoding for CVRP enables Constraint-Enhanced QAOA to recover verified optimal solutions on benchmarks without additional capacity qubits.
A generic exact solver for vehicle routing and related problems.Mathematical Programming, 183:483 – 523, 2019
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative 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.
The authors integrate quantum annealing and QAOA as subroutines for pricing and separation in a branch-price-and-cut algorithm for vehicle routing problems.
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 Subroutines in Branch-Price-and-Cut for Vehicle Routing
The authors integrate quantum annealing and QAOA as subroutines for pricing and separation in a branch-price-and-cut algorithm for vehicle routing problems.
-
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.