Pages that link to "Item:Q3503837"
From MaRDI portal
The following pages link to Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837):
Displaying 14 items.
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- Computing equilibria in discounted dynamic games (Q668745) (← links)
- How to select a small set of diverse solutions to mixed integer programming problems (Q833594) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
