Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
From MaRDI portal
Publication:3544267
DOI10.1137/050646500zbMath1165.90685OpenAlexW2066253573WikidataQ58002894 ScholiaQ58002894MaRDI QIDQ3544267
Giovanni Rinaldi, Christoph Buchheim
Publication date: 5 December 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050646500
max-cut probleminteger nonlinear programmingpseudo-Boolean functionsmultilinear function optimizationpolynomial zero-one optimization
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, Matroid optimisation problems with nested non-linear monomials in the objective function, On the product knapsack problem, On decomposability of multilinear sets, Optimal quadratic reformulations of fourth degree pseudo-Boolean functions, On the impact of running intersection inequalities for globally solving polynomial optimization problems, Efficient linear reformulations for binary polynomial optimization problems, On the complexity of binary polynomial optimization over acyclic hypergraphs, A polyhedral study of lifted multicuts, Berge-acyclic multilinear 0-1 optimization problems, Quadratic reformulations of nonlinear binary optimization problems, Norm bounds and underestimators for unconstrained polynomial integer minimization, A class of valid inequalities for multilinear 0-1 optimization problems, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables, When is rounding allowed in integer nonlinear optimization?, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, Matroid optimization problems with monotone monomials in the objective
Uses Software
