Parallelizable search-space decomposition for large-scale combinatorial optimization problems using quadratic unconstrained binary optimization

Eiji Kawase, Shuta Kikuchi, Hideaki Tamai, Shu Tanaka · 2026

Read Parallelizable search-space decomposition for large-scale combinatorial optimization problems using quadratic unconstrained binary optimization by Eiji Kawase, Shuta Kikuchi, Hideaki Tamai, Shu Tanaka (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/PMC13542160.txt.

Description

Eiji Kawase and colleagues propose a cutting method in 2026. The field is large-scale optimisation. Huge planning problems grow until direct solving is hopeless. Their method cuts such problems into independent pieces. Ordinary solvers can then finish the pieces in parallel. Routing and scheduling are the target uses.

The method first scores how strongly variables interact. It phrases the cutting task as a maximum-cut problem. An Ising-model solver then makes the cut. Delivery routing tests showed clear gains. Feasible answers came far more often than before. The method reached in one minute what the naive method needed thirty minutes for. It also cut most variables out of the main problem.

Catalog record

CREATOREiji Kawase, Shuta Kikuchi, Hideaki Tamai, Shu Tanaka
YEAR2026
COLLECTIONPAPERS
FORMATTXT
FILE SIZE39439
LICENSEhttps://creativecommons.org/licenses/by/4.0
RIGHTSCC BY
SOURCEEurope PMC

Source: https://europepmc.org/article/MED/PMC13542160

Browse the full library · About the Tower of Babel