Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
From MaRDI portal
Recommendations
- A polynomial case of unconstrained zero-one quadratic optimization
- Quadrature-based polynomial optimization
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- scientific article; zbMATH DE number 1199854
- Quadratic optimization in 0-1 variables
- An Optimization Framework for Polynomial Zerofinders
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Quadratic convex reformulations for quadratic 0-1 programming
- An algorithm for quadratic zero-one programs
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities
Cited in
(27)- Matroid optimisation problems with nested non-linear monomials in the objective function
- On the product knapsack problem
- 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
- Matroid optimization problems with monotone monomials in the objective
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- Polynomial unconstrained binary optimisation -- part 1
- When is rounding allowed in integer nonlinear optimization?
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- A polyhedral study of lifted multicuts
- Terse integer linear programs for Boolean optimization
- Roof duality for polynomial 0–1 optimization
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Quadratic reformulations of nonlinear binary optimization problems
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- A polynomial case of unconstrained zero-one quadratic optimization
- Efficient linear reformulations for binary polynomial optimization problems
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- A quadratic simplex algorithm for primal optimization over zero-one polytopes
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- Simple odd -cycle inequalities for binary polynomial optimization
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- Quadratization and convexification in polynomial binary optimization
This page was built for publication: Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544267)
