The multilinear polytope for acyclic hypergraphs
From MaRDI portal
Recommendations
Cites work
- A class of valid inequalities for multilinear 0-1 optimization problems
- A convex envelope formula for multilinear functions
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A polyhedral study of binary polynomial programs
- Analysis of bounds for multilinear functions
- Balanced matrices
- Berge-acyclic multilinear 0-1 optimization problems
- Boolean polynomials and set functions
- Combinatorial optimization. Packing and covering
- Concave extensions for nonlinear 0-1 maximization problems
- Convex envelopes for edge-concave functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Degrees of acyclicity for hypergraphs and relational database schemes
- Explicit convex and concave envelopes through polyhedral subdivisions
- Global optimization of nonconvex problems with multilinear intermediates
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 3404028 (Why is no real title available?)
- Hypergraphs with no special cycles
- Introduction to algorithms
- Jointly Constrained Biconvex Programming
- Matroid optimisation problems with nested non-linear monomials in the objective function
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- On the cut polytope
- Pseudo-Boolean optimization
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
- Some results on the strength of relaxations of multilinear functions
- The Boolean quadratic polytope: Some characteristics, facets and relatives
Cited in
(31)- On decomposability of multilinear sets
- Berge-acyclic multilinear 0-1 optimization problems
- A note on solving DiDi's driver-order matching problem
- Matroid optimization problems with monotone monomials in the objective
- Multilinear sets with two monomials and cardinality constraints
- Graph, clique and facet of Boolean logical polytope
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- A new framework to relax composite functions in nonlinear programs
- A polyhedral study of lifted multicuts
- Multinerves and Helly numbers of acyclic families
- The Running Intersection Relaxation of the Multilinear Polytope
- Tractable relaxations of composite functions
- A polyhedral study of binary polynomial programs
- Complexity of optimizing over the integers
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Efficient linear reformulations for binary polynomial optimization problems
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- Simple odd -cycle inequalities for binary polynomial optimization
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
- Short paper -- The binary linearization complexity of pseudo-Boolean functions
- Sparse intersection checking for sparse polynomial zonotopes
- Quadratization and convexification in polynomial binary optimization
- Convexification techniques for fractional programs
- Convexifying multilinear sets with cardinality constraints: structural properties, nested case and extensions
- The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
- Submodular maximization and its generalization through an intersection cut lens
- Extending a continuous RLT-based algorithm to mixed-integer polynomial problems
- Factorized binary polynomial optimization
This page was built for publication: The multilinear polytope for acyclic hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637506)
