A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs

DOI10.1007/S10107-023-02009-4MaRDI QIDQ6608035zbMATH OpenFDO

Authors Alberto Del Pia, Aida Khajavirad

Publication date 19 September 2024

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

hypergraph acyclicitybinary polynomial optimizationmultilinear polytopepolynomial-size extended formulation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Integer programming (90C10) Boolean programming (90C09)

Recommendations

• The multilinear polytope for acyclic hypergraphs
• The Running Intersection Relaxation of the Multilinear Polytope
• Berge-acyclic multilinear 0-1 optimization problems
• Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
• A polyhedral study of binary polynomial programs

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• A class of valid inequalities for multilinear 0-1 optimization problems
• A hybrid LP/NLP paradigm for global optimization relaxations
• A polyhedral study of binary polynomial programs
• Berge-acyclic multilinear 0-1 optimization problems
• Cardinality constrained multilinear sets
• Combinatorial optimization. Packing and covering
• Concave extensions for nonlinear 0-1 maximization problems
• Degrees of acyclicity for hypergraphs and relational database schemes
• Disjunctive programming: Properties of the convex hull of feasible points
• LP formulations for polynomial optimization problems
• On decomposability of multilinear sets
• On the Desirability of Acyclic Database Schemes
• On the complexity of binary polynomial optimization over acyclic hypergraphs
• On the impact of running intersection inequalities for globally solving polynomial optimization problems
• On the strength of recursive McCormick relaxations for binary polynomial optimization
• Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
• Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The Running Intersection Relaxation of the Multilinear Polytope
• The multilinear polytope for 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)