Pages that link to "Item:Q4958553"
From MaRDI portal
The following pages link to The Running Intersection Relaxation of the Multilinear Polytope (Q4958553):
Displaying 12 items.
- Multilinear sets with two monomials and cardinality constraints (Q2097167) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q2164692) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- On optimization problems in acyclic hypergraphs (Q6161450) (← 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)
- 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)
