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

05/26/2017
by   Fred Glover, et al.
0

The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory and binary discrete optimization. The use of preprocessing to transform the graph representing the QUBO problem into a smaller equivalent graph is important for improving solution quality and time for both exact and metaheuristic algorithms and is a step towards mapping large scale QUBO to hardware graphs used in quantum annealing computers. In an earlier paper (Lewis and Glover, 2016) a set of rules was introduced that achieved significant QUBO reductions as verified through computational testing. Here this work is extended with additional rules that provide further reductions that succeed in exactly solving 10 An algorithm and associated data structures to efficiently implement the entire set of rules is detailed and computational experiments are reported that demonstrate their efficacy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2017

Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis

The Quadratic Unconstrained Binary Optimization problem (QUBO) has becom...
research
01/26/2018

Reducing Binary Quadratic Forms for More Scalable Quantum Annealing

Recent advances in the development of commercial quantum annealers such ...
research
04/04/2021

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

The broad applicability of Quadratic Unconstrained Binary Optimization (...
research
03/09/2020

Graph Clustering Via QUBO and Digital Annealing

This article empirically examines the computational cost of solving a kn...
research
09/21/2017

Robust Optimization of Unconstrained Binary Quadratic Problems

In this paper we focus on the unconstrained binary quadratic optimizatio...
research
05/31/2017

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

Multi-start algorithms are a common and effective tool for metaheuristic...
research
11/12/2021

Verified Optimization

Optimization is used extensively in engineering, industry, and finance, ...

Please sign up or login with your details

Forgot password? Click here to reset