mQO combines differentiable QUBO optimization with mutation-based resets and local search to outperform heuristics and solvers on large-scale combinatorial problems by addressing stalling in local maxima.
A branch and bound algorithm for the maximum clique problem.Computers & operations research, 19(5):363–375
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Mutation-Guided Differentiable Quadratic Combinatorial Optimization
mQO combines differentiable QUBO optimization with mutation-based resets and local search to outperform heuristics and solvers on large-scale combinatorial problems by addressing stalling in local maxima.