Abstract
The problem of minimizing a pseudo-Boolean function, that is, a real-valued function of 0–1 variables, arises in many applications. A quadratization is a reformulation of this nonlinear problem into a quadratic one, obtained by introducing a set of auxiliary binary variables. A desirable property for a quadratization is to introduce a small number of auxiliary variables. We present upper and lower bounds on the number of auxiliary variables required to define a quadratization for several classes of specially structured functions, such as functions with many zeros, symmetric, exact k-out-of-n, at least k-out-of-n and parity functions, and monomials with a positive coefficient, also called positive monomials. Most of these bounds are logarithmic in the number of original variables, and we prove that they are best possible for several of the classes under consideration. For positive monomials and for some other symmetric functions, a logarithmic bound represents a significant improvement with respect to the best bounds previously published, which are linear in the number of original variables. Moreover, the case of positive monomials is particularly interesting: indeed, when a pseudo-Boolean function is represented by its unique multilinear polynomial expression, a quadratization can be obtained by separately quadratizing its monomials.
Similar content being viewed by others
References
Alon N, Füredi Z (1993) Covering the cube by affine hyperplanes. Eur J Combin 14:79–83
Anthony M, Boros E, Crama Y, Gruber A (2016) Quadratization of symmetric pseudo-Boolean functions. Discrete Appl Math 203:1–12
Anthony M, Boros E, Crama Y, Gruber A (2017) Quadratic reformulations of nonlinear binary optimization problems. Math Program 162(1–2):115–144
Boros E, Crama Y, Rodríguez-Heck E (2018) Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables. In: ISAIM. ISAIM, International symposium on artificial intelligence and mathematics, Fort Lauderdale. http://isaim2018.cs.virginia.edu/
Boros E, Fix A, Gruber AG, Zabih R (2011) A graph cut algorithm for higher order Markov random fields. In: 2011 International conference on computer vision. IEEE conference proceedings for ICCV 2011, Barcelona, Spain. https://doi.org/10.1109/ICCV.2011.6126347
Boros E, Hammer PL (2002) Pseudo-Boolean optimization. Discrete Appl Math 123(1):155–225
Burer S, Letchford AN (2012) Non-convex mixed-integer nonlinear programming: a survey. Surv Oper Res Manag Sci 17(2):97–106
Crama Y, Hammer PL (2011) Boolean functions: theory, algorithms, and applications. Cambridge University Press, New York
D’Ambrosio C, Lodi A (2011) Mixed integer nonlinear programming tools: a practical overview. 4OR 9(4):329–349
Fix A, Gruber A, Boros E, Zabih R (2015) A hypergraph-based reduction for higher-order binary Markov random fields. IEEE Trans Pattern Anal Mach Intell 37:1387–1395
Freedman D, Drineas P (2005) Energy minimization via graph cuts: settling what is possible. In: IEEE computer society conference on computer vision and pattern recognition, CVPR 2005, vol 2, pp 939–946
Hammer PL, Rosenberg I, Rudeanu S (1963) On the determination of the minima of pseudo-Boolean functions. Studii si Cercetari Matematice 14:359–364 (in Romanian)
Hammer PL, Rudeanu S (1968) Boolean methods in operations research and related areas. Springer, Berlin
Hansen P, Jaumard B, Mathon V (1993) State-of-the-art survey: constrained nonlinear 0–1 programming. ORSA J Comput 5(2):97–119
Hemmecke R, Köppe M, Lee J, Weismantel R (2010) Nonlinear integer programming. In: Jünger M, Liebling TM, Naddef D, Nemhauser GL, Pulleyblank WR, Reinelt G, Rinaldi G, Wolsey LA (eds) 50 Years of integer programming, 1958–2008. Springer, Berlin, pp 561–618
Ishikawa H (2009) Higher-order clique reduction in binary graph cut. In: IEEE conference on computer vision and pattern recognition, CVPR, pp 2993–3000
Ishikawa H (2011) Transformation of general binary MRF minimization to the first-order case. IEEE Trans Pattern Anal Mach Intell 33(6):1234–1249
Kolmogorov V, Zabih R (2004) What energy functions can be minimized via graph cuts? IEEE Trans Pattern Anal Mach Intell 26(2):147–159
Linial N, Radhakrishnan J (2005) Essential covers of the cube by hyperplanes. J Combin Theory Ser A 109(2):331–338
Rodríguez-Heck E (2018) Linear and quadratic reformulation techniques for nonlinear optimization problems in binary variables. Ph.D. thesis, University of Liège
Rosenberg IG (1975) Reduction of bivalent maximization to the quadratic case. Cahiers du Centre d’Études de Recherche Opérationnelle 17:71–74
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Boros, E., Crama, Y. & Rodríguez-Heck, E. Compact quadratizations for pseudo-Boolean functions. J Comb Optim 39, 687–707 (2020). https://doi.org/10.1007/s10878-019-00511-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-019-00511-0
Keywords
- Nonlinear binary optimization
- Quadratic binary optimization
- Pseudo-Boolean functions
- Reformulation methods