Pages that link to "Item:Q408381"

The following pages link to Gap inequalities for non-convex mixed-integer quadratic programs (Q408381):

Displaying 12 items.

• Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
• A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
• Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
• Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
• A note on convex reformulation schemes for mixed integer quadratic programs (Q2251547) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
• Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
• Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
• Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm (Q3167623) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• On the existence of duality gaps for mixed integer programming (Q5460687) (← links)