most citedVariable Reduction For Quadratic Unconstrained Binary Optimization

3 citations · 11 across the 10 of their papers we have counts for

collaborators

10 papers

math.OC2021★ 2 cited

Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions

Amit Verma, Mark Lewis, Gary Kochenberger

Quadratic Unconstrained Binary Optimization (QUBO) is recognized as a unifying framework for modeling a wide range of problems. Problems can be solved with commercial solvers custo…

math.OC2021★ 1 cited

QUBO transformation using Eigenvalue Decomposition

Amit Verma, Mark Lewis

Quadratic Unconstrained Binary Optimization (QUBO) is a general-purpose modeling framework for combinatorial optimization problems and is a requirement for quantum annealers. This…

q-bio.BM2021★ 1 cited

Predicting 3D RNA Folding Patterns via Quadratic Binary Optimization

Mark W. Lewis, Amit Verma, Rick Hennig

The structure of an RNA molecule plays a significant role in its biological function. Predicting structure given a one dimensional sequence of RNA nucleotide bases is a difficult a…

math.OC2021★ 3 cited

Variable Reduction For Quadratic Unconstrained Binary Optimization

Amit Verma, Mark Lewis

Quadratic Unconstrained Binary Optimization models are useful for solving a diverse range of optimization problems. Constraints can be added by incorporating quadratic penalty term…

cs.AI2021★ 1 cited

Constraint Programming to Discover One-Flip Local Optima of Quadratic Unconstrained Binary Optimization Problems

Amit Verma, Mark Lewis

The broad applicability of Quadratic Unconstrained Binary Optimization (QUBO) constitutes a general-purpose modeling framework for combinatorial optimization problems and are a req…

cs.AI2021

Goal Seeking Quadratic Unconstrained Binary Optimization

Amit Verma, Mark Lewis

The Quadratic Unconstrained Binary Optimization (QUBO) modeling and solution framework is a requirement for quantum and digital annealers. However optimality for QUBO problems of a…

cs.AI2017

Robust Optimization of Unconstrained Binary Quadratic Problems

Mark Lewis, Gary Kochenberger, John Metcalfe

In this paper we focus on the unconstrained binary quadratic optimization model, maximize x^t Qx, x binary, and consider the problem of identifying optimal solutions that are robus…

cs.AI2017

A Diversified Multi-Start Algorithm for Unconstrained Binary Quadratic Problems Leveraging the Graphics Processor Unit

Mark W. Lewis

Multi-start algorithms are a common and effective tool for metaheuristic searches. In this paper we amplify multi-start capabilities by employing the parallel processing power of t…

cs.AI2017★ 3 cited

Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis

Mark Lewis, Fred Glover

The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a v…

cs.AI2017

Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems

Fred Glover, Mark Lewis, Gary Kochenberger

The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory an…