QUBO Formulation Using Sequence Pair With Search Space Restriction for Rectangle Packing Problem

QUBO Formulation Using Sequence Pair With Search Space Restriction for Rectangle Packing Problem

The development of quantum annealing has stimulated interest in solving NP-hard problems, including various industrial problems, such as quadratic unconstrained binary optimization (QUBO), with specialized solvers. This study focuses on the rectangle packing problem (RPP), which is an NP-hard proble...

Full description

Bibliographic Details
Main Authors: Akihisa Okada, Keisuke Otaki, Tadayoshi Matsumori, Hiroaki Yoshida, Kotaro Terada, Nozomu Togawa
Format: Article
Language:English
Published: IEEE 2024-01-01
Series:IEEE Access
Subjects:
Rectangle packing problem
sequence pair
quadratic unconstrained binary optimization
Online Access:https://ieeexplore.ieee.org/document/10734100/

Internet

https://ieeexplore.ieee.org/document/10734100/

Similar Items