3 citations · 11 across the 9 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…
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…
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…
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…