The following pages link to The MILP Road to MIQCP (Q2897304):
Displaying 27 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Optimal mapping of cloud virtual machines (Q325399) (← links)
- Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- An integer linear programming approach for a class of bilinear integer programs (Q1785220) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- A note on convex reformulation schemes for mixed integer quadratic programs (Q2251547) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
- Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
