当前位置: X-MOL 学术arXiv.cs.CC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems
arXiv - CS - Computational Complexity Pub Date : 2019-11-18 , DOI: arxiv-1911.08043
Bas Lodewijks

We discuss several mappings from well-known NP-hard problems to Quadratic Unconstrained Binary Optimisation problems which are treated incorrectly by Lucas. We provide counterexamples and correct the mappings. We also extend the body of QUBO formulations of NP-complete and NP-hard optimisation problems by discussing additional problems.

中文翻译:

将 NP-hard 和 NP-complete 优化问题映射到二次无约束二元优化问题

我们讨论了从众所周知的 NP-hard 问题到 Lucas 错误处理的二次无约束二元优化问题的几种映射。我们提供反例并纠正映射。我们还通过讨论其他问题扩展了 NP 完全和 NP 难优化问题的 QUBO 公式的主体。
更新日期:2020-08-04
down
wechat
bug