Results 101 to 110 of about 18,556 (186)

On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem

Journal of Global Optimization
Abstract The aim of this paper is to solve linear semidefinite programs arising from higher-order Lasserre relaxations of unconstrained binary quadratic optimization problems. For this we use an interior point method with a preconditioned conjugate gradient method solving the linear systems.
Soodeh Habibi, Michal Kocvara, Michael Stingl   +2 more
openaire   +4 more sources

Problem-structure-informed quantum approximate optimization for large-scale unit commitment with limited qubits

iEnergy
As power systems expand, solving the unit commitment problem (UCP) becomes increasingly challenging due to the curse of dimensionality, and traditional methods often struggle to balance computational efficiency and solution optimality.
Jingxian Zhou, Ziqing Zhu, Linghua Zhu, Siqi Bu   +3 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

Optimizing Heat Treatment Schedules via QUBO Formulation

Applied Sciences
Quadratic Unconstrained Binary Optimization (QUBO) is the problem of finding binary variable assignments that minimize a given quadratic objective function.
Ikuto Nakatsukasa, Koji Nakano, Victor Parque, Yasuaki Ito   +3 more
doaj   +1 more source

Construction of SubQUBOs by K-Means Clustering of QUBO Variables

IEEE Access
Ising machines are specialized solvers for combinatorial optimization problems (COPs), which are typically formulated as quadratic unconstrained binary optimization (QUBO) models.
Yuko Kamishima, Shuta Kikuchi, Shu Tanaka   +2 more
doaj   +1 more source

Studies on the Complexity of Quadratic Unconstrained Binary Optimization Problems [PDF]

Studies on the Complexity of Quadratic Unconstrained Binary Optimization Problems
Doctor of Philosophy in Informatics and Data ...
openaire   +1 more source

Quantum annealing for inverse kinematics in robotics. [PDF]

Sci Rep
Salloum H, Savin S, Kholodov Y, Ryzhakov G, Farina M, Oseledets I.   +5 more
europepmc   +1 more source

Constructing and characterizing trillion-scale combinatorial chemical library. [PDF]

J Cheminform
Su J, Song FV, Huang D, Liao M.
europepmc   +1 more source

A preprocessing technique for quadratic unconstrained binary optimization

Discrete Optimization
S. Gueye, P. Michelon
openaire   +1 more source

Exploring the Boundaries of Modern Quantum Annealers with RNA Structure Prediction. [PDF]

J Phys Chem B
Andrews B, Abraham J, Fox D, Radja A.
europepmc   +1 more source