Pages that link to "Item:Q304240"

The following pages link to Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240):

Displaying 32 items.

• A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
• Global optimization algorithm for mixed integer quadratically constrained quadratic program (Q515761) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems (Q656459) (← links)
• Extending the QCR method to general mixed-integer programs (Q662304) (← links)
• A note on solving quadratic programs using mixed-integer programming (Q1115803) (← links)
• Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
• Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
• Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
• An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
• Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
• Convex quadratic mixed-integer problems with quadratic constraints (Q2050251) (← links)
• Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
• Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
• A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
• A note on convex reformulation schemes for mixed integer quadratic programs (Q2251547) (← links)
• Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
• Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
• Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
• Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
• Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← links)
• A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154) (← links)
• (Q5208413) (← links)
• Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)
• Using general triangle inequalities within quadratic convex reformulation method (Q6175568) (← links)
• A tight compact quadratically constrained convex relaxation of the optimal power flow problem (Q6568415) (← links)