scientific article; zbMATH DE number 1560357

MaRDI QIDQ4527209zbMATH OpenFDO

Authors Yasutoshi Yajima

Publication date 19 July 2001

zbMATH Keywords

cutting plane methodnonconvex quadratic programsnumerical experimentsreformulation and linearization techniquesemi-definite programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1664574
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A polyhedral approach for nonconvex quadratic programming problems with box constraints
• Quadratic maximization and semidefinite relaxation
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations

Cited in

(2)

• scientific article; zbMATH DE number 2167564 (Why is no real title available?)
• Using general triangle inequalities within quadratic convex reformulation method

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527209)