Experimental validation of volume-based comparison for double-McCormick relaxations
From MaRDI portal
Publication:2011595
DOI10.1007/978-3-319-59776-8_19zbMath1492.90140arXiv1608.02527OpenAlexW2521846913MaRDI QIDQ2011595
Emily Speakman, Han Yu, Jon Lee
Publication date: 4 August 2017
Full work available at URL: https://arxiv.org/abs/1608.02527
global optimizationmixed integer nonlinear optimizationspatial branch-and-boundMcCormick inequalitiestrilinear monomials
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Gaining or losing perspective, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Volume computation for sparse Boolean quadric relaxations
Uses Software
Cites Work
- Approximating polyhedra with sparse inequalities
- Matroid polytopes and their volumes
- Two poset polytopes
- A decomposition of 2-weak vertex-packing polytopes
- Geometric comparison of combinatorial polytopes
- The volume of relaxed Boolean-quadric and cut polytopes
- A convex envelope formula for multilinear functions
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- A branch-and-reduce approach to global optimization
- On convex relaxations of quadrilinear terms
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- On Volumes of Permutation Polytopes
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Quantifying Double McCormick
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Benchmarking optimization software with performance profiles.
- Unnamed Item
