Results 41 to 50 of about 18,347 (178)
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
f-Flip strategies for unconstrained binary quadratic programming [PDF]
, 2015 Unconstrained binary quadratic programming (UBQP) provides a unifying modeling and solution framework for solving a remarkable range of binary optimization problems, including many accompanied by constraints.
F. Glover, J.K. Hao
core +4 more sources
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
Ising formulations of many NP problems [PDF]
, 2014 We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering and satisfiability.
Lucas, Andrew
core +3 more sources
An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems [PDF]
, 2009 We propose a new fast algorithm for solving one of the standard approaches to ill-posed linear inverse problems (IPLIP), where a (possibly non-smooth) regularizer is minimized under the constraint that the solution explains the observations sufficiently ...
Afonso, Manya V. +2 more
core +2 more sources
Fast Image Recovery Using Variable Splitting and Constrained Optimization [PDF]
, 2009 We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where the objective includes an $\ell_2$ data-fidelity term and a non-smooth ...
Afonso, Manya V. +2 more
core +2 more sources
Computational Complexity of Quadratic Unconstrained Binary Optimization
, 2021 In this paper, we study the computational complexity of the quadratic unconstrained binary optimization (QUBO) problem under the functional problem FP^NP categorization. We focus on four sub-classes: (1) When all coefficients are integers QUBO is FP^NP-complete.
openaire +2 more sources
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
Tight Sum-of-Squares lower bounds for binary polynomial optimization problems [PDF]
, 2016 We give two results concerning the power of the Sum-of-Squares(SoS)/Lasserre hierarchy. For binary polynomial optimization problems of degree $2d$ and an odd number of variables $n$, we prove that $\frac{n+2d-1}{2}$ levels of the SoS/Lasserre hierarchy ...
Kurpisz, Adam +2 more
core +2 more sources
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