Results 111 to 120 of about 2,283 (206)
SoftwareXSubstitution boxes provide nonlinearity in ciphers, and their algebraic representation affects cryptanalytic models. SBoxQUBOSearch is a C++17 package that generates explicit and implicit relations for tabulated S-boxes, exhaustively searches only fixed ...
Elżbieta Burek, Michał Misztal
doaj +1 more source
Penalty Weights in QUBO Formulations: Permutation Problems
, 2022 Optimisation algorithms designed to work on quantum computers or other specialised hardware have been of research interest in recent years. Many of these solver can only optimise problems that are in binary and quadratic form. Quadratic Unconstrained Binary Optimisation (QUBO) is therefore a common formulation used by these solvers.
openaire +3 more sources
Construction of SubQUBOs by K-Means Clustering of QUBO Variables
IEEE AccessIsing machines are specialized solvers for combinatorial optimization problems (COPs), which are typically formulated as quadratic unconstrained binary optimization (QUBO) models.
Yuko Kamishima +2 more
doaj +1 more source
Investigating the Relation Between Problem Hardness and QUBO Properties
171182Combinatorial optimization problems, integral to various scientific and industrial applications, often vary significantly in their complexity and computational difficulty. Transforming such problems into Quadratic Unconstrained Binary Optimization (
Gerlach, Thore Thassilo, Mücke, Sascha
core +1 more source
Truss Sizing Optimization: Symbolic Finite Element Method QUBO Repository
, 2020 This repository contains the codes, datasheets, and text files related to the symbolic finite-element truss QUBO method chapter in my thesis.
Wils, Kevin
core +1 more source
AlgorithmsThis study introduces a novel train-and-test approach referred to as apprenticeship learning (AL) for generating selection hyper-heuristics to solve the Quadratic Unconstrained Binary Optimisation (QUBO) problem.
Jack Cakebread +4 more
doaj +1 more source
MOCQA: A Multi-Core Optimizer for Constrained Quadratic Assignment
IEEE AccessDespite advances in general processing hardware, optimization of NP-hard problems remains a time and compute-intensive task, with the end of Dennard Scaling leading to the increased development of domain-specific hardware in this area.
Mohammad Bagherbeik +4 more
doaj +1 more source
Solving QUBO problems with cP systems
Journal of Membrane ComputingAbstractP 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á +3 more
openaire +1 more source
QUBO Dual Bounds via SDP Plane Projection Method
, 2023 In this paper, we present a new method to solve a certain type of Semidefinite Programming (SDP) problems. These types of SDPs naturally arise in the Quadratic Convex Reformulation (QCR) method and can be used to obtain dual bounds of Quadratic ...
Sofranac, Boro +2 more
core
Research on Optimization of Excess Yield by Quantum Annealing Algorithm on QUBO Model
This paper establishes a quadratic unconstrained binary optimization (QUBO) model for portfolio optimization with excess returns. Initially, we decompose the portfolio optimization problem with excess returns and select the QUBO model. Following this, we
Gu, Haotian
core +1 more source