Results 101 to 110 of about 1,712 (186)

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

Five Starter Problems: Solving Quadratic Unconstrained Binary Optimization Models on Quantum Computers [PDF]

Several articles and books adequately cover quantum computing concepts, such as gate/circuit model (and Quantum Approximate Optimization Algorithm, QAOA), Adiabatic Quantum Computing (AQC), and Quantum Annealing (QA).
Mazumder, Arul, Tayur, Sridhar
core   +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

A framework for automatically setting multiple penalty weights in Quadratic Unconstrained Binary Optimization [PDF]

This paper proposes a novel framework for automatically setting penalty weights in the Quadratic Unconstrained Binary Optimization (QUBO) to handle problems with multiple constraints. Quantum computing and quantum-inspired methods have gained prominence,
Alberto Moraglio (21060269), Jiajie Liu (21044159)   +1 more
core  

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation [PDF]

, 2019
We propose a solution approach for the problem (P) of minimizing an unconstrained binary polynomial optimization problem. We call this method PQCR (Polynomial Quadratic Convex Reformulation). The resolution is based on a 3-phase method.
Lazare, Arnaud, Lambert, Amélie, Elloumi, Sourour   +2 more
core   +1 more source

A preprocessing technique for quadratic unconstrained binary optimization

Discrete Optimization
S. Gueye, P. Michelon
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