Results 11 to 20 of about 22,651 (215)
On some features of Quadratic Unconstrained Binary Optimization with random coefficients [PDF]
Quadratic Unconstrained Binary Optimization (QUBO or UBQP) is concerned with maximizing/minimizing the quadratic form H(J,η)=W∑i,jJi,jηiηj\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb ...
Marco Isopi +2 more
openalex +3 more sources
Strategic Solution Combination in Scatter Search for Quadratic Unconstrained Binary Optimization
: Quadratic Unconstrained Binary Optimization (QUBO) has become an important unifying model for formu-lating combinatorial optimization problems. Since QUBO is NP-hard, it is common to apply heuristics to them.
Justin Pauckert +2 more
openalex +2 more sources
In this paper, we consider the inclusion of the solvency capital requirement (SCR) into portfolio optimization by the use of a quadratic proxy model. The Solvency II directive requires insurance companies to calculate their SCR based on the complete loss
Ivica Turkalj +8 more
doaj +2 more sources
Quadratic Unconstrained Binary Formulation for Traffic Signal Optimization on Real-World Maps
The D-Wave quantum annealing machine can quickly find the optimal solution for quadratic unconstrained binary optimization (QUBO). One of the applications where the use of quantum annealing is desired is in problems requiring rapid calculations. One such
Reo Shikanai +2 more
openalex +2 more sources
Rydberg-atom graphs for quadratic unconstrained binary optimization problems [PDF]
There is a growing interest in harnessing the potential of the Rydberg‐atom system to address complex combinatorial optimization challenges. Here an experimental demonstration of how the quadratic unconstrained binary optimization (QUBO) problem can be ...
Andrew Byun +6 more
openalex +2 more sources
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 ...
Bahram Alidaee, Haibo Wang, Lutfu S. Sua
doaj +2 more sources
Quadratic Unconstrained Binary Optimization (QUBO) problems are central to combinatorial optimization but challenging due to their exponential solution space.
Aditya Ranjan +4 more
openalex +2 more sources
Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing [PDF]
Flexible job-shop scheduling problems (FJSPs) represent one of the most complex combinatorial optimization challenges. Modern production systems and control processes demand rapid decision-making in scheduling.
Kaihan Fu +3 more
doaj +2 more sources
Efficient bit labeling in factorization machines with annealing for traveling salesman problem [PDF]
To efficiently determine an optimum parameter combination in a large-scale problem, it is essential to convert the parameters into available variables in actual machines. Specifically, quadratic unconstrained binary optimization problems are solved using
Shota Koshikawa +2 more
doaj +2 more sources
An encoding of argumentation problems using quadratic unconstrained binary optimization [PDF]
In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems.
Marco Baioletti, Francesco Santini
openalex +2 more sources

