Efficient partition of integer optimization problems with one-hot encoding

Shuntaro Okada, Masayuki Ohzeki, Shinichiro Taguchi

Research output: Contribution to journalArticlepeer-review

58 Citations (Scopus)


Quantum annealing is a heuristic algorithm for solving combinatorial optimization problems, and hardware for implementing this algorithm has been developed by D-Wave Systems Inc. The current version of the D-Wave quantum annealer can solve unconstrained binary optimization problems with a limited number of binary variables. However, the cost functions of several practical problems are defined by a large number of integer variables. To solve these problems using the quantum annealer, integer variables are generally binarized with one-hot encoding, and the binarized problem is partitioned into small subproblems. However, the entire search space of the binarized problem is considerably larger than that of the original integer problem and is dominated by infeasible solutions. Therefore, to efficiently solve large optimization problems with one-hot encoding, partitioning methods that extract subproblems with as many feasible solutions as possible are required. In this study, we propose two partitioning methods and demonstrate that they result in improved solutions.

Original languageEnglish
Article number13036
JournalScientific Reports
Issue number1
Publication statusPublished - 2019 Dec 1


Dive into the research topics of 'Efficient partition of integer optimization problems with one-hot encoding'. Together they form a unique fingerprint.

Cite this