Results 91 to 100 of about 1,190 (203)

An Optimal Constraint for QUBO Models

, 2021
8 pages, 16 images, 4 ...
openaire   +2 more sources

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

QUBO Decision Tree: Annealing Machine Extends Decision Tree Splitting [PDF]

, 2022
Koichiro Yawata, Yoshihiro Osakabe, Takuya Okuyama, Akinori Asahara   +3 more
openalex   +1 more source

Standardization of Multi-Objective QUBOs

Multi-objective optimization involving Quadratic Unconstrained Binary Optimization (QUBO) problems arises in various domains. A fundamental challenge in this context is the effective balancing of multiple objectives, each potentially operating on very different scales. This imbalance introduces complications such as the selection of appropriate weights
Lee, Loong Kuan, Gerlach, Thore Thassilo, Piatkowski, Nico   +2 more
openaire   +2 more sources

Solving QUBO problems with cP systems

Journal of Membrane Computing
AbstractP systems with compound terms (cP systems) have been proposed by Radu Nicolescu in 2018. These expressive cP systems have been used to solve well-known NP-complete problems efficiently, such as the Hamiltonian path, traveling salesman, 3-coloring, and software verification problems.
Lucie Ciencialová, Michael J. Dinneen, Radu Nicolescu, Luděk Cienciala   +3 more
openaire   +1 more source

Application of quantum computing to temporal aggregation for efficient capacity expansion in power systemsOPSD

International Journal of Electrical Power & Energy Systems
Capacity expansion planning (CEP) requires full-year, hourly time series to capture variability in load and renewable generation, but this temporal resolution makes optimization problems computationally challenging.
Ankana Singha, Sambeet Mishra, Miadreza Shafie-khah   +2 more
doaj   +1 more source

Sampling electronic structure QUBOs with Ocean and Mukai solvers [PDF]

, 2021
Alexander Teplukhin, Brian K. Kendrick, Susan M. Mniszewski, Sergei Tretiak, Pavel A. Dub   +4 more
openalex   +1 more source

Quantum-annealing-inspired algorithms for multijet clustering

Physics Letters B
Jet clustering or reconstruction is a crucial component at high-energy colliders, a procedure to identify sprays of collimated particles originating from the fragmentation and hadronization of quarks and gluons.
Hideki Okawa, Xian-Zhe Tao, Qing-Guo Zeng, Man-Hong Yung   +3 more
doaj   +1 more source

Criptografía para problemas QUBO

Los problemas cuadráticos sin restricciones de optimización binaria (QUBO) son ubicuos y pueden ser resueltos vía computación clásica o cuántica. Su resolución vía internet conlleva una posible exposición de la información codificada en dicho problema de optimización.
Caruso, Mariano, Escánez Expósito, Daniel, Caballero Gil, Pino, Kuchkovsky, Carlos, Varela Vaca, Ángel Jesús (Coordinador), Ceballos Guerrero, Rafael (Coordinador), Reina Quintero, Antonia María (Coordinador)   +6 more
openaire   +3 more sources

Multi-Objective Portfolio Optimization Using a Quantum Annealer

Mathematics
In this study, the portfolio optimization problem is explored, using a combination of classical and quantum computing techniques. The portfolio optimization problem with specific objectives or constraints is often a quadratic optimization problem, due to
Esteban Aguilera, Jins de Jong, Frank Phillipson, Skander Taamallah, Mischa Vos   +4 more
doaj   +1 more source