Pages that link to "Item:Q6161903"
From MaRDI portal
The following pages link to On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903):
Displaying 4 items.
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- McCormick-Based Relaxations of Algorithms (Q3563896) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs (Q6608035) (← links)