Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes

DOI10.1016/j.dam.2019.09.007zbMath1484.52004arXiv1810.12625OpenAlexW2975971813MaRDI QIDQ2064282

Emily Speakman, Gennadiy Averkov

Publication date: 5 January 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.12625

zbMATH Keywords

mixed volumeconvexificationspatial branch-and-bound

Mathematics Subject Classification ID

Mixed volumes and related topics in convex geometry (52A39)

Related Items

Gaining or losing perspective, Volumes of \(s\)-Orlicz convex simplices and geometric inequalities in higher dimensional spaces

Cites Work

• Unnamed Item
• Geometric comparison of combinatorial polytopes
• A convex envelope formula for multilinear functions
• Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
• Theoretical challenges towards cutting-plane selection
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• A branch-and-reduce approach to global optimization
• An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
• The Convex Envelope of (n–1)-Convex Functions
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Quantifying Double McCormick
• Convex Bodies The Brunn-MinkowskiTheory