3 citations
5 papers
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…
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…
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…
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…
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…