A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
DOI10.1007/S10107-023-02009-4MaRDI QIDQ6608035FDOQ6608035
Authors: Alberto Del Pia, Aida Khajavirad 
Publication date: 19 September 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
hypergraph acyclicitybinary polynomial optimizationmultilinear polytopepolynomial-size extended formulation
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Integer programming (90C10) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Disjunctive programming: Properties of the convex hull of feasible points
- On the Desirability of Acyclic Database Schemes
- The Matching Polytope has Exponential Extension Complexity
- Combinatorial optimization. Packing and covering
- A hybrid LP/NLP paradigm for global optimization relaxations
- Concave extensions for nonlinear 0-1 maximization problems
- Degrees of acyclicity for hypergraphs and relational database schemes
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- A class of valid inequalities for multilinear 0-1 optimization problems
- A Polyhedral Study of Binary Polynomial Programs
- On decomposability of multilinear sets
- The Multilinear Polytope for Acyclic Hypergraphs
- Berge-acyclic multilinear 0-1 optimization problems
- LP Formulations for Polynomial Optimization Problems
- Cardinality constrained multilinear sets
- The Running Intersection Relaxation of the Multilinear Polytope
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- On the complexity of binary polynomial optimization over acyclic hypergraphs
This page was built for publication: A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608035)
