Pages that link to "Item:Q4637506"
From MaRDI portal
The following pages link to The Multilinear Polytope for Acyclic Hypergraphs (Q4637506):
Displaying 21 items.
- On decomposability of multilinear sets (Q1659675) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Multilinear sets with two monomials and cardinality constraints (Q2097167) (← links)
- Graph, clique and facet of Boolean logical polytope (Q2124813) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q2164692) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
- Tractable Relaxations of Composite Functions (Q5085133) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q6589749) (← links)
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs (Q6608035) (← links)
- Short paper -- The binary linearization complexity of pseudo-Boolean functions (Q6633276) (← links)
