Quadratization and convexification in polynomial binary optimization
From MaRDI portal
Cites work
- A class of valid inequalities for multilinear 0-1 optimization problems
- A dynamic inequality generation scheme for polynomial programming
- A polyhedral study of binary polynomial programs
- An introduction to polynomial and semi-algebraic optimization
- Analysis of bounds for multilinear functions
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Berge-acyclic multilinear 0-1 optimization problems
- Compact quadratizations for pseudo-Boolean functions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex underestimators of polynomials
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 3473554 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3212646 (Why is no real title available?)
- scientific article; zbMATH DE number 3316982 (Why is no real title available?)
- Jointly Constrained Biconvex Programming
- Matroid optimisation problems with nested non-linear monomials in the objective function
- On decomposability of multilinear sets
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Pseudo-Boolean optimization
- Quadratic reformulations of nonlinear binary optimization problems
- Quadratization of symmetric pseudo-Boolean functions
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- SCIP: solving constraint integer programs
- Simple odd -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
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The basic algorithm for pseudo-Boolean programming revisited
- The multilinear polytope for acyclic hypergraphs
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
This page was built for publication: Quadratization and convexification in polynomial binary optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912351)
