A Polyhedral Study of Binary Polynomial Programs
From MaRDI portal
Publication:5739146
DOI10.1287/moor.2016.0804zbMath1364.90225OpenAlexW2548938557WikidataQ57568045 ScholiaQ57568045MaRDI QIDQ5739146
Aida Khajavirad, Alberto Del Pia
Publication date: 2 June 2017
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5237f81ee08ee052f6bba7e3840bccb43ebbbebd
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items (21)
Graph, clique and facet of Boolean logical polytope ⋮ Matroid optimisation problems with nested non-linear monomials in the objective function ⋮ On decomposability of multilinear sets ⋮ Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Error bounds for monomial convexification in polynomial optimization ⋮ (Global) optimization: historical notes and recent developments ⋮ On the impact of running intersection inequalities for globally solving polynomial optimization problems ⋮ Complexity of optimizing over the integers ⋮ On the strength of recursive McCormick relaxations for binary polynomial optimization ⋮ On the complexity of binary polynomial optimization over acyclic hypergraphs ⋮ A polyhedral study of lifted multicuts ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ On the Consistent Path Problem ⋮ The Multilinear Polytope for Acyclic Hypergraphs ⋮ A new framework to relax composite functions in nonlinear programs ⋮ Berge-acyclic multilinear 0-1 optimization problems ⋮ A class of valid inequalities for multilinear 0-1 optimization problems ⋮ The Running Intersection Relaxation of the Multilinear Polytope ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ Multilinear sets with two monomials and cardinality constraints
This page was built for publication: A Polyhedral Study of Binary Polynomial Programs
