Results 81 to 90 of about 1,190 (203)

Partitioning QUBO with two-way one-hot conditions on traveling salesman problems for city distributions with multiple clusters

Frontiers in Computer Science
We introduce a method for solving a quadratic unconstrained binary optimization (QUBO) with the two-way one-hot constraints by dividing the QUBO into parts and solving it with an Ising machine.
Akihiro Yatabe, Akihiro Yatabe
doaj   +1 more source

Hybrid subQUBO Annealing With a Correction Process for Multi-Day Intermodal Trip Planning

IEEE Access
The multi-day intermodal trip planning problem (MITPP) is an optimization problem that seeks to create the optimal route to visit Point-of-Interest (POI) and hotels over days. This problem involves coordinating intermodal transportation, such as walking,
Tatsuya Noguchi, Keisuke Fukada, Siya Bao, Nozomu Togawa   +3 more
doaj   +1 more source

Research on Maximization of Bank Loan Final In-come Based on QUBO Model [PDF]

, 2023
Yaxin Wei
openalex   +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

Frequent Itemset Mining using QUBO

, 2019
In this paper we propose a R-step approximation to solve frequent itemset mining on quantum hardware like quantum annealing or QAOA. The idea is to search for the set of items where the minimal 2-item frequency is maximal. This can be represented as a maximum clique problem.
openaire   +2 more sources

Student Surpasses the Teacher: Apprenticeship Learning for Quadratic Unconstrained Binary Optimisation

Algorithms
This 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, Warren G. Jackson, Daniel Karapetyan, Andrew J. Parkes, Ender Özcan   +4 more
doaj   +1 more source

On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (Max-)k-SAT with Integer Programming [PDF]

, 2023
Gregory Morse, Tamás Kozsik
openalex   +1 more source

MOCQA: A Multi-Core Optimizer for Constrained Quadratic Assignment

IEEE Access
Despite 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, Parastoo Ashtari, Kouichi Kanda, Hirotaka Tamura, Ali Sheikholeslami   +4 more
doaj   +1 more source

A Hybrid Framework Using a QUBO Solver For Permutation-Based Combinatorial Optimization [PDF]

, 2020
Siong Thye Goh, Sabrish Gopalakrishnan, Jianyuan Bo, Hoong Chuin Lau   +3 more
openalex   +1 more source

Rejection-free Monte Carlo simulation of QUBO and Lechner–Hauke–Zoller optimization problems [PDF]

, 2022
Yoshihiro Nambu
openalex   +1 more source