Precomputed embeddings reduce the preprocessing overhead of a quantum-annealer-based Benders decomposition by about an order of magnitude on small transmission-network expansion problems, with no loss in solution quality.
The De- composition Algorithm for Linear Programs
1 Pith paper cite this work, alongside 749 external citations. Polarity classification is still indexing.
1
Pith paper citing it
749
external citations · OpenAlex
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Performance enhancing of hybrid quantum-classical Benders approach for MILP optimization
Precomputed embeddings reduce the preprocessing overhead of a quantum-annealer-based Benders decomposition by about an order of magnitude on small transmission-network expansion problems, with no loss in solution quality.