Short paper -- The binary linearization complexity of pseudo-Boolean functions
From MaRDI portal
Cites work
- A class of valid inequalities for multilinear 0-1 optimization problems
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A polyhedral study of binary polynomial programs
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Berge-acyclic multilinear 0-1 optimization problems
- Exhaustive search for low-autocorrelation binary sequences
- scientific article; zbMATH DE number 3212646 (Why is no real title available?)
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- L’algebre de Boole et ses applications en recherche operationnelle
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Low autocorrelation binary sequences
- Mixed-integer bilinear programming problems
- On decomposability of multilinear sets
- On defining sets of vertices of the hypercube by linear inequalities
- On the ground states of the Bernasconi model
- Pseudo-Boolean optimization
- Quadratic reformulations of nonlinear binary optimization problems
- Reducibility among combinatorial problems
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- The multilinear polytope for acyclic hypergraphs
- The Running Intersection Relaxation of the Multilinear Polytope
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
This page was built for publication: Short paper -- The binary linearization complexity of pseudo-Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633276)
