Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences

Related Items (1)

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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Quadratization of symmetric pseudo-Boolean functions
Quadratic reformulations of nonlinear binary optimization problems
Hypergraphs with no special cycles
Complexity evaluation of benchmark instances for the \(p\)-median problem
Pseudo-Boolean optimization
The Boolean quadratic polytope: Some characteristics, facets and relatives
The NP-completeness of the bandwidth minimization problem
A partial k-arboretum of graphs with bounded treewidth
Branch and peg algorithms for the simple plant location problem.
Matroid optimisation problems with nested non-linear monomials in the objective function
On decomposability of multilinear sets
A class of valid inequalities for multilinear 0-1 optimization problems
The cut polytope and the Boolean quadric polytope
Berge-acyclic multilinear 0-1 optimization problems
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
On the impact of running intersection inequalities for globally solving polynomial optimization problems
The basic algorithm for pseudo-Boolean programming revisited
On the Desirability of Acyclic Database Schemes
Degrees of acyclicity for hypergraphs and relational database schemes
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
Exhaustive search for low-autocorrelation binary sequences
The Multilinear Polytope for Acyclic Hypergraphs
Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
The design of efficient dynamic programming and transfer matrix enumeration algorithms
Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
A Polyhedral Study of Binary Polynomial Programs
Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
On the strength of recursive McCormick relaxations for binary polynomial optimization
On the complexity of binary polynomial optimization over acyclic hypergraphs

This page was built for publication: Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences