Pages that link to "Item:Q5739146"

The following pages link to A Polyhedral Study of Binary Polynomial Programs (Q5739146):

Displaying 29 items.

• Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
• On decomposability of multilinear sets (Q1659675) (← links)
• A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
• Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← 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)
• Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← 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)
• Convex hull representations of special monomials of binary variables (Q2311191) (← links)
• Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
• A polyhedral study of lifted multicuts (Q2688466) (← links)
• (Q3348697) (← links)
• (Q3757994) (← links)
• The Multilinear Polytope for Acyclic Hypergraphs (Q4637506) (← links)
• The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
• The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
• On the Consistent Path Problem (Q5144803) (← links)
• (Q6076152) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)
• On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
• On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← 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)