2 citations · 2 across the 5 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
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
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…