Pages that link to "Item:Q2195679"

The following pages link to On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679):

Displaying 8 items.

• Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q2164692) (← 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)
• 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)