Adaptive graph shrinking with constraint-aware merging and a spectral stopping rule reduces QUBO size for MDKP, MIS, and QAP, improving simulated VQE solution quality on the shrunken instances.
A review of simheuristics: Extending metaheuristics to deal with stochastic com- binatorial optimization problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems
Adaptive graph shrinking with constraint-aware merging and a spectral stopping rule reduces QUBO size for MDKP, MIS, and QAP, improving simulated VQE solution quality on the shrunken instances.