Pages that link to "Item:Q304240"
From MaRDI portal
The following pages link to Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240):
Displaying 11 items.
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- Global optimization algorithm for mixed integer quadratically constrained quadratic program (Q515761) (← 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)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← 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)
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
