most citedVariable Reduction For Quadratic Unconstrained Binary Optimization

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

collaborators

10 papers

math.OC20212 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.OC20211 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.BM20211 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.OC20213 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.AI20211 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…