In the Quadratic Unconstrained Binary Optimization problem, we try to find the assignment for a finite amount of 0/1 decision variables that minimizes a given quadratic term with these variables. The problem statement is given in the LP format and all solvers will present a variable assigment as a solution.