Short paper -- The binary linearization complexity of pseudo-Boolean functions

Cites Work

Unnamed Item
Quadratic reformulations of nonlinear binary optimization problems
Mixed-integer bilinear programming problems
Pseudo-Boolean optimization
Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
On defining sets of vertices of the hypercube by linear inequalities
On decomposability of multilinear sets
A class of valid inequalities for multilinear 0-1 optimization problems
Berge-acyclic multilinear 0-1 optimization problems
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
Low autocorrelation binary sequences
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
L’algebre de Boole et ses applications en recherche operationnelle
Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
Exhaustive search for low-autocorrelation binary sequences
On the ground states of the Bernasconi model
The Multilinear Polytope for Acyclic Hypergraphs
The Running Intersection Relaxation of the Multilinear Polytope
Reducibility among Combinatorial Problems
Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
A Polyhedral Study of Binary Polynomial Programs
Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences

This page was built for publication: Short paper -- The binary linearization complexity of pseudo-Boolean functions