|
|
|
|
|
Bahram Alidaee, Haibo Wang and Lutfu S. Sua
Quadratic unconstrained binary optimization (QUBO) is a classic NP-hard problem with an enormous number of applications. Local search strategy (LSS) is one of the most fundamental algorithmic concepts and has been successfully applied to a wide range of ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dhidhi Pambudi and Masaki Kawamura
The quadratic unconstrained binary optimization (QUBO) problem is categorized as an NP-hard combinatorial optimization problem. The variable neighborhood search (VNS) algorithm is one of the leading algorithms used to solve QUBO problems. As neighborhood...
ver más
|
|
|
|
|
|
|
|
|
|
|
Aleksey I. Pakhomchik, Vladimir V. Voloshinov, Valerii M. Vinokur and Gordey B. Lesovik
There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers. An alternative is using t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Aaron Barbosa, Elijah Pelofske, Georg Hahn and Hristo N. Djidjev
Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hiroshi Arai and Harumi Haraguchi
We proposed the method that translates the two-dimensional CSP for minimizing the number of cuts to the Ising model. After that, we conducted computer experiments of the proposed model using the benchmark problem. From the above, the following results ar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tomas Vyskocil and Hristo Djidjev
Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters of a ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christos Papalitsas, Theodore Andronikos, Konstantinos Giannakis, Georgia Theocharopoulou and Sofia Fanarioti
This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a quadratic unconstrained binary optimization (QUBO) problem. The time windows impose time constraints that a feasible solution must satisfy. These take the form of inequality...
ver más
|
|
|
|
|
|