Results 121 to 130 of about 2,283 (206)

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

IEEE Access
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.
Akihisa Okada, Keisuke Otaki, Tadayoshi Matsumori, Hiroaki Yoshida, Kotaro Terada, Nozomu Togawa   +5 more
doaj   +1 more source

A QUBO Model to the Tail Assignment Problem

Proceedings of the 13th International Conference on Agents and Artificial Intelligence, 2021
Luis N. Martins, Ana Paula Rocha 0001, António J. M. Castro   +2 more
openaire   +2 more sources

Study of the impact of spectral features of QUBO problems on the performance of Quantum Annealers

, 2023
LAUREA MAGISTRALENegli ultimi anni si è assistito a un forte interesse nello studio dei Quantum Annealers (QA) come risolutori euristici di problemi di Quadratic Uncostrained Binary Optimization (QUBO).
Pellini, Riccardo
core  

Ferroelectric compute-in-memory annealer for combinatorial optimization problems

Nature Communications
Computationally hard combinatorial optimization problems (COPs) are ubiquitous in many applications. Various digital annealers, dynamical Ising machines, and quantum/photonic systems have been developed for solving COPs, but they still suffer from the ...
Xunzhao Yin, Yu Qian, Alptekin Vardar, Marcel Günther, Franz Müller, Nellie Laleni, Zijian Zhao, Zhouhang Jiang, Zhiguo Shi, Yiyu Shi, Xiao Gong, Cheng Zhuo, Thomas Kämpfe, Kai Ni   +13 more
doaj   +1 more source

QUBO Formulations and Quantum Optimization for the Multi-Dimensional Knapsack Problem With Conflict, Forcing, and Precedence Constraints

IEEE Access
Constrained knapsack variants are well-suited for QUBO-based quantum optimization, but adding logical relations can inflate the binary model and complicate penalty selection.
Evren Guney, Joachim Ehrenthal
doaj   +1 more source

Solving break minimization problems in mirrored double round-robin tournament with QUBO solver

, 2023
The break minimization problem is a fundamental problem in sports scheduling. Recently, its quadratic unconstrained binary optimization (QUBO) formulation has been proposed, which has gained much interest with the rapidly growing field of quantum ...
Fujii, Koichi, Matsui, Tomomi
core  

Enhanced QUBO Formulations for The Flow Shop Scheduling Problem

International audiencen recent years, the Flow shop Scheduling Problem (FSP) has gained significant attention, prompting researchers to develop various methods, from conventional to hybrid optimization algorithms.
Farhani, Yousra, Hnaien, Faicel, Arbaoui, Taha, Saiem, Malak   +3 more
core   +1 more source

Adiabatic Quantum Computing with QUBO Formulations

, 2016
We study two types of problems in this thesis, graph covering problems including the Dominating Set and Edge Cover which are classic combinatorial problems and the Graph Isomorphism Problem with several of its variations.
Hua, R
core  

Efficient Exploration of Phenol Derivatives Using QUBO Solvers with Group Contribution-Based Approaches

Molecule screening from a vast number of possible compounds is a challenging task. The emergence of quadratic unconstrained binary optimization (QUBO) solvers provides alternatives to address this issue.
Jheng-Wei Su (18101351), Tzu-Wei Lin (2726515), Tsung-Hui Li (2678770), Ying-Yuan Lee (18101360), Shin-Hong Liu (18101357), Pin-Hong Chen (17976386), Lien-Po Yu (18101354), Ching-Ray Chang (1526881), Chien-Hung Cho (18101348)   +8 more
core   +1 more source

Decomposed Quadratization: Efficient QUBO Formulation for Learning Bayesian Network

Algorithms and hardware for solving quadratic unconstrained binary optimization (QUBO) problems have made significant recent progress. This advancement has focused attention on formulating combinatorial optimization problems as quadratic polynomials.
Shikuri, Yuta
core   +1 more source