Results 41 to 50 of about 1,712 (186)
On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization [PDF]
SIAM Journal on Optimization, 2016 Minor update in 2016: simplified ...
openaire +2 more sources
Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
IEEE Transactions on Quantum Engineering, 2020 Solving combinatorial optimization problems on current noisy quantum devices is currently being advocated for (and restricted to) binary polynomial optimization with equality constraints via quantum heuristic approaches.
Claudio Gambella, Andrea Simonetto
doaj +1 more source
Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
Frontiers in Physics, 2021 The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization. This paper shows how to solve it on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem ...
Siddharth Jain
doaj +1 more source
Petri Net Modeling for Ising Model Formulation in Quantum Annealing
Applied Sciences, 2021 Quantum annealing is an emerging new platform for combinatorial optimization, requiring an Ising model formulation for optimization problems. The formulation can be an essential obstacle to the permeation of this innovation into broad areas of everyday ...
Morikazu Nakamura +2 more
doaj +1 more source
Algorithms, 2022 There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers.
Aleksey I. Pakhomchik +3 more
doaj +1 more source
IEEE AccessIsing machines, including quantum annealing machines, are promising next-generation computers for combinatorial optimization problems. However, due to hardware limitations, most Ising-type hardware can only solve objective functions expressed in linear ...
Kazuki Ikeuchi +2 more
doaj +1 more source
Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver
Frontiers in Applied Mathematics and Statistics, 2023 The aim of this study was to explore the information disclosure (ID) problem, which involves selecting pairs of two sides before matching toward user-oriented optimization. This problem is known to be useful for mobility-on-demand (MoD) platforms because
Keisuke Otaki +2 more
doaj +1 more source
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem [PDF]
Informatica, 2006 Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization problem consists in finding a subset of objects for which the overall profit is maximized.
openaire +2 more sources
Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization
, 2023 We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA). Our approach requires fewer couplings and fewer physical qubits than the current state-of-the-art, which results in higher ...
Jonas Nüßlein +4 more
openaire +2 more sources
{Q-FW}: {A} Hybrid Classical-Quantum {F}rank-{W}olfe for Quadratic Binary Optimization [PDF]
, 2022 We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linearly-constrained, binary optimization problems on quantum annealers (QA).
Birdal, T. +6 more
core +1 more source