Pages that link to "Item:Q2018868"
From MaRDI portal
The following pages link to Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868):
Displaying 11 items.
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- A new branch-and-bound approach to semi-supervised support vector machine (Q1699749) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- A new effective branch-and-bound algorithm to the high order MIMO detection problem (Q2012893) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- A neurodynamic approach to zero-one quadratic programming (Q2234482) (← links)
- A note on convex reformulation schemes for mixed integer quadratic programs (Q2251547) (← links)
- An intuitionistic fuzzy set based \(S^3\)VM model for binary classification with mislabeled information (Q2272418) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints (Q6534829) (← links)
