Convex hull representations of special monomials of binary variables
From MaRDI portal
Recommendations
- A polyhedral study of binary polynomial programs
- Convex hull representations for bounded products of variables
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Computable representations for convex hulls of low-dimensional quadratic forms
Cites work
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Concave extensions for nonlinear 0-1 maximization problems
- Error bounds for monomial convexification in polynomial optimization
- Explicit convex and concave envelopes through polyhedral subdivisions
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
- Lectures on Polytopes
- L’algebre de Boole et ses applications en recherche operationnelle
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The Boolean quadratic polytope: Some characteristics, facets and relatives
Cited in
(6)- Ideal representations of lexicographic orderings and base-2 expansions of integer variables
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- A polyhedral study of binary polynomial programs
- Convex hull representations for bounded products of variables
- Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes
- Computable representations for convex hulls of low-dimensional quadratic forms
This page was built for publication: Convex hull representations of special monomials of binary variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311191)
