Pages that link to "Item:Q517317"

The following pages link to Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317):

Displaying 12 items.

• Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
• Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
• On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon (Q1688448) (← links)
• Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
• Exact and approximate results for convex envelopes of special structured functions over simplices (Q2141722) (← links)
• A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
• New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
• Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
• Tractable Relaxations of Composite Functions (Q5085133) (← links)
• \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables (Q6052055) (← links)
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)