Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Discrete Optimization

A preprocessing technique for quadratic unconstrained binary optimization

Serigne Guèye, Philippe Yves Paul Michelon

Published Oct 25, 2025• 2 citations
Publisher

Abstract

To solve combinatorial optimization problems more easily, it can be valuable to identify a set of necessary or sufficient conditions that an optimal solution of the problem must satisfy. For instance, weak and strong duality conditions in linear programming support the development of the well-known optimization algorithms for these problems. Similarly, the Karush–Kuhn–Tucker conditions give necessary and sufficient conditions for optimality in convex quadratic programming that underlie the development of optimization algorithms in this domain. Although such continuous conditions do not exist for integer programming, some necessary conditions can be derived from Karush–Kuhn–Tucker conditions for the Quadratic Unconstrained Binary Optimization (QUBO) problem. We present these conditions and show how they lead to a derivation of well-known criteria for fixing the values of single variables in the QUBO problem. From this, we show how to generalize these criteria to fix a product of any number of p (integer) literals, which also may be viewed as a generalization of the persistency notion, consisting of clauses of a Constraint Satisfaction Problem that the optimal solution must satisfy. We then couple our list of persistencies with state-of-the-art rules not covered by our approach. The resulting integrated set of conditions for fixing values of variables is tested in computational experiments on instances from standard databases available in the literature, showing that we can fix more variables and reduce problems more fully than previous approaches.

DOI
10.1016/j.disopt.2025.100914

Related papers

New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences

Tavares, Gabriel

This dissertation investigates the Quadratic Unconstrained Binary Optimization (QUBO) problem, i.e. the problem of minimizing a quadratic function in binary variables. QUBO is studied at two complementary levels. First, there is an algorithmic aspect that tells how to preprocess the problem, how to find heuristics, how to get improved bounds and how to solve the problem with all the above ingredients.Second, there is a practical aspect that uses QUBO to solve various applications from the engineering and social sciences fields including: via minimization, 2D/3D Ising models, 1D Ising chain models, image binarization, hierarchical clustering, greedy graph coloring/partitioning, MAX-2-SAT, MIN-VC, MAX-CLIQUE, MAX-CUT, graph stability and minimum k-partition.Several families of fast heuristics for QUBO are analyzed, which include a novel probabilistic based class of methods.It is shown that there is a unique maximal set of persistencies for the linearization model for QUBO.This set is determined in polynomial time by a maximum flow followed by the computation of the strong components of a network that has 2n+2 nodes, where n is the number of variables. The identification of the above persistencies leads to a unique decomposition of the function, such that each component can be optimized separately. To find further persistencies, two additional techniques are proposed: one is based on the second order derivatives of Hammer et al. [HH81]; the other technique is a probing procedure on the two possible values of the variables.These preprocessing tools work remarkably well for certain classes of problems.We improved the Iterated Roof-Dual bound (IRD) of [BH89] by proposing two combinatorial methods: one was named the squeezed IRD; and the second was called the project-and-lift IRD method.The cubic-dual bound can be found by means of linear programming by adding a set of triangle inequalities to the standard linearization, whose number is cubic in the number of variables. We show that this set can be reduced depending on the coefficients of the terms of the function. This leads to the possibility of computing the cubic-duals of larger QUBOs.

•Jan 1, 2008•8 citations

Preprocessing of unconstrained quadratic binary optimization

Endre Boros, Peter L. Hammer, Gabriel Tavares

We propose several efficient preprocessing techniques for Unconstrained Quadratic Binary Optimization (QUBO), including the direct use of enhanced versions of known basic techniques (e.g., implications derived from first and second order derivatives and from roof–duality), and the integrated use (e.g., by probing and by consensus) of the basic techniques. The application of these techniques is implemented using a natural network flow model of QUBO. The use of the proposed preprocessing techniques provides: (i) a lower bound of the minimum of the objective function, (ii) the values of some of the variables in some or every optimum, (iii) binary relations (equations, inequalities, or non-equalities) between the values of certain pairs of variables in some or every optimum, and (iv) the decomposition (if possible) of the original problem into several smaller pairwise independent QUBO problems. Extensive computational experience showing the efficiency of the proposed techniques is presented. Substantial problem simplifications, improving considerably the existing techniques, are demonstrated on benchmark problems as well as on randomly generated ones. In particular, it is shown that 100% data reduction is achieved using the proposed preprocessing techniques for MAX-CUT graphs derived from VLSI design, MAX-Clique in c-fat graphs derived from fault diagnosis, and minimum vertex cover problems in random planar graphs of up to 500 000 vertices. Acknowledgements: The third author was partially financially supported by the Portuguese FCT and by the FSE in the context of the III Quadro Comunitario de Apoio.

•Jan 1, 2006•68 citations

Uma reformulação quadrática para variáveis binárias aplicadas ao problema de otimização quadrática irrestrita

Petra Maria Bartmeyer, Christiano Lyra

The Quadratic Unconstrained Binary Optimization problem (QUBO) is the optimization of a quadratic function where the variables are binary; it is frequently used to model combinatorial problems in operational research and graph theory.QUBO is an NP-Complete problem and a challenge to exact methods.Therefore, the problem has been approached with heuristics.Here, we propose new ideas to solve QUBO with exact methods.We develop a new quadratic formulation that maps the binary problem into an equivalent continuous optimization problem with a single quadratic constraint.A further development delves into Lagrangian inspired concepts to obtain an equivalent unconstrained formulation.The case studies illustrate the benefit and limitations of both formulations.Also, the computational experiments show that problems with up to 2500 variables were solved with processing times under 500 seconds to achieve an average gap under 1%; these results also show that the approach allowed to solve, with an exact method, instances of 1500 more binary variables than the instances considered in previous papers.

Anais do Simpósio Brasileiro de Pesquisa Operacional•Jan 1, 2018•0 citations

Technique for Transforming Discrete Optimization Problems into QUBO Form

A. M. Semenov, Sergey R. Usmanov, Aleksey K. Fedorov

Practical discrete optimization problems often contain multidimensional arrays of variables interrelated by linear constraints such as equalities and inequalities. Values of each variable depend on its specific meaning and can be binary, integer, or discrete. These conditions make it technically difficult to reduce the original problem statement to QUBO form. We identify and examine three necessary transformations of the original problem statement to reduce it to QUBO form, namely transition from a multidimensional to a one-dimensional array, transition to binary variables in mixed problems, and incorporating linear constraints into the objective function in the form of quadratic penalties. We present and prove computationally convenient formulas to simplify these transformations. In particular, the formulas for the transition from a multidimensional to a one-dimensional array of variables are based on the application of the Kronecker product of matrices. The transformations considered are illustrated by numerous examples and used, as an application, to reduce a number of well-known problems in graph theory and combinatorial optimization to QUBO form.

arXiv:2410.21074•Problems of Information Transmission•Sep 1, 2025•2 citations

Deriving Compact QUBO Models via Multilevel Constraint Transformation

Оксана Сергеевна Пичугина, Yingcong Tan, J. Christopher Beck

With the advances in customized hardware for quantum annealing and digital/CMOS Annealing, Quadratic Unconstrained Binary Optimization (QUBO) models have received growing attention in the optimization literature. Motivated by an existing general-purpose approach that derives QUBO models from binary linear programs (BLP), we propose a novel Multilevel Constraint Transformation Scheme (MLCTS) that derives QUBO models with fewer ancillary binary variables. We formulate sufficient conditions for the existence of a compact QUBO formulation (i.e., in the original BLP decision space) in terms of constraint levelness and demonstrate the flexibility and applicability of MLCTS on synthetic examples and several well-known combinatorial optimization problems, i.e., the Maximum 2-Satisfiability Problem, the Linear Ordering Problem, the Community Detection Problem, and the Maximum Independence Set Problem. For a proof-of-concept, we compare the performance of two QUBO models for the latter problem on both a general-purpose software-based solver and a hardware-based QUBO solver. The MLCTS-derived models demonstrate significantly better performance for both solvers, in particular, solving up to seven times more instances with the hardware-based approach.

arXiv:2404.03610•Apr 4, 2024•3 citations

Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs

Cheng-Han Huang, Yongliang Sun, Chaoyan Huang +2 more

Many combinatorial optimization problems admit quadratic unconstrained binary formulations (QUBO) which can often be relaxed to the box $[0,1]^n$ and optimized using scalable gradient-based methods. However, the resulting non-convex landscape can often contain local optima that are spurious or infeasible. In this paper, we establish sufficient structural conditions on quadratic penalties that rule out these failures, guaranteeing that every local minimizer of the relaxed problem is both binary and feasible. For each problem we study, we examine existing QUBO formulations when available, identify why they fail when they do, and propose alternative relaxed QUBOs that satisfy our conditions. We show for several common combinatorial problems, including open-pit mining, 0--1 knapsack, and traveling salesman formulations, that these constructions allow gradient-based methods such as projected gradient descent and Adam to be safely applied to obtain valid binary solutions. Our results clarify when differentiable optimization is a reliable local solver for quadratic combinatorial objectives.

arXiv:2606.28734•Jun 27, 2026•0 citations
To solve combinatorial optimization problems more easily, it can be valuable to identify a set of necessary or sufficient conditions that an optimal solution of the problem must satisfy. For instance, weak and strong duality conditions in linear programming support the development of the well-known optimization algorithms for these problems. Similarly, the Karush–Kuhn–Tucker conditions give necessary and sufficient conditions for optimality in convex quadratic programming that underlie the development of optimization algorithms in this domain. Although such continuous conditions do not exist for integer programming, some necessary conditions can be derived from Karush–Kuhn–Tucker conditions for the Quadratic Unconstrained Binary Optimization (QUBO) problem. We present these conditions and show how they lead to a derivation of well-known criteria for fixing the values of single variables in the QUBO problem. From this, we show how to generalize these criteria to fix a product of any number of p (integer) literals, which also may be viewed as a generalization of the persistency notion, consisting of clauses of a Constraint Satisfaction Problem that the optimal solution must satisfy. We then couple our list of persistencies with state-of-the-art rules not covered by our approach. The resulting integrated set of conditions for fixing values of variables is tested in computational experiments on instances from standard databases available in the literature, showing that we can fix more variables and reduce problems more fully than previous approaches.
This dissertation investigates the Quadratic Unconstrained Binary Optimization (QUBO) problem, i.e. the problem of minimizing a quadratic function in binary variables. QUBO is studied at two complementary levels. First, there is an algorithmic aspect that tells how to preprocess the problem, how to find heuristics, how to get improved bounds and how to solve the problem with all the above ingredients.Second, there is a practical aspect that uses QUBO to solve various applications from the engineering and social sciences fields including: via minimization, 2D/3D Ising models, 1D Ising chain models, image binarization, hierarchical clustering, greedy graph coloring/partitioning, MAX-2-SAT, MIN-VC, MAX-CLIQUE, MAX-CUT, graph stability and minimum k-partition.Several families of fast heuristics for QUBO are analyzed, which include a novel probabilistic based class of methods.It is shown that there is a unique maximal set of persistencies for the linearization model for QUBO.This set is determined in polynomial time by a maximum flow followed by the computation of the strong components of a network that has 2n+2 nodes, where n is the number of variables. The identification of the above persistencies leads to a unique decomposition of the function, such that each component can be optimized separately. To find further persistencies, two additional techniques are proposed: one is based on the second order derivatives of Hammer et al. [HH81]; the other technique is a probing procedure on the two possible values of the variables.These preprocessing tools work remarkably well for certain classes of problems.We improved the Iterated Roof-Dual bound (IRD) of [BH89] by proposing two combinatorial methods: one was named the squeezed IRD; and the second was called the project-and-lift IRD method.The cubic-dual bound can be found by means of linear programming by adding a set of triangle inequalities to the standard linearization, whose number is cubic in the number of variables. We show that this set can be reduced depending on the coefficients of the terms of the function. This leads to the possibility of computing the cubic-duals of larger QUBOs.
We propose several efficient preprocessing techniques for Unconstrained Quadratic Binary Optimization (QUBO), including the direct use of enhanced versions of known basic techniques (e.g., implications derived from first and second order derivatives and from roof–duality), and the integrated use (e.g., by probing and by consensus) of the basic techniques. The application of these techniques is implemented using a natural network flow model of QUBO. The use of the proposed preprocessing techniques provides: (i) a lower bound of the minimum of the objective function, (ii) the values of some of the variables in some or every optimum, (iii) binary relations (equations, inequalities, or non-equalities) between the values of certain pairs of variables in some or every optimum, and (iv) the decomposition (if possible) of the original problem into several smaller pairwise independent QUBO problems. Extensive computational experience showing the efficiency of the proposed techniques is presented. Substantial problem simplifications, improving considerably the existing techniques, are demonstrated on benchmark problems as well as on randomly generated ones. In particular, it is shown that 100% data reduction is achieved using the proposed preprocessing techniques for MAX-CUT graphs derived from VLSI design, MAX-Clique in c-fat graphs derived from fault diagnosis, and minimum vertex cover problems in random planar graphs of up to 500 000 vertices. Acknowledgements: The third author was partially financially supported by the Portuguese FCT and by the FSE in the context of the III Quadro Comunitario de Apoio.
The Quadratic Unconstrained Binary Optimization problem (QUBO) is the optimization of a quadratic function where the variables are binary; it is frequently used to model combinatorial problems in operational research and graph theory.QUBO is an NP-Complete problem and a challenge to exact methods.Therefore, the problem has been approached with heuristics.Here, we propose new ideas to solve QUBO with exact methods.We develop a new quadratic formulation that maps the binary problem into an equivalent continuous optimization problem with a single quadratic constraint.A further development delves into Lagrangian inspired concepts to obtain an equivalent unconstrained formulation.The case studies illustrate the benefit and limitations of both formulations.Also, the computational experiments show that problems with up to 2500 variables were solved with processing times under 500 seconds to achieve an average gap under 1%; these results also show that the approach allowed to solve, with an exact method, instances of 1500 more binary variables than the instances considered in previous papers.
Practical discrete optimization problems often contain multidimensional arrays of variables interrelated by linear constraints such as equalities and inequalities. Values of each variable depend on its specific meaning and can be binary, integer, or discrete. These conditions make it technically difficult to reduce the original problem statement to QUBO form. We identify and examine three necessary transformations of the original problem statement to reduce it to QUBO form, namely transition from a multidimensional to a one-dimensional array, transition to binary variables in mixed problems, and incorporating linear constraints into the objective function in the form of quadratic penalties. We present and prove computationally convenient formulas to simplify these transformations. In particular, the formulas for the transition from a multidimensional to a one-dimensional array of variables are based on the application of the Kronecker product of matrices. The transformations considered are illustrated by numerous examples and used, as an application, to reduce a number of well-known problems in graph theory and combinatorial optimization to QUBO form.
With the advances in customized hardware for quantum annealing and digital/CMOS Annealing, Quadratic Unconstrained Binary Optimization (QUBO) models have received growing attention in the optimization literature. Motivated by an existing general-purpose approach that derives QUBO models from binary linear programs (BLP), we propose a novel Multilevel Constraint Transformation Scheme (MLCTS) that derives QUBO models with fewer ancillary binary variables. We formulate sufficient conditions for the existence of a compact QUBO formulation (i.e., in the original BLP decision space) in terms of constraint levelness and demonstrate the flexibility and applicability of MLCTS on synthetic examples and several well-known combinatorial optimization problems, i.e., the Maximum 2-Satisfiability Problem, the Linear Ordering Problem, the Community Detection Problem, and the Maximum Independence Set Problem. For a proof-of-concept, we compare the performance of two QUBO models for the latter problem on both a general-purpose software-based solver and a hardware-based QUBO solver. The MLCTS-derived models demonstrate significantly better performance for both solvers, in particular, solving up to seven times more instances with the hardware-based approach.
Many combinatorial optimization problems admit quadratic unconstrained binary formulations (QUBO) which can often be relaxed to the box [0,1]n[0,1]^n[0,1]n and optimized using scalable gradient-based methods. However, the resulting non-convex landscape can often contain local optima that are spurious or infeasible. In this paper, we establish sufficient structural conditions on quadratic penalties that rule out these failures, guaranteeing that every local minimizer of the relaxed problem is both binary and feasible. For each problem we study, we examine existing QUBO formulations when available, identify why they fail when they do, and propose alternative relaxed QUBOs that satisfy our conditions. We show for several common combinatorial problems, including open-pit mining, 0--1 knapsack, and traveling salesman formulations, that these constructions allow gradient-based methods such as projected gradient descent and Adam to be safely applied to obtain valid binary solutions. Our results clarify when differentiable optimization is a reliable local solver for quadratic combinatorial objectives.