scientific article; zbMATH DE number 1795733

MaRDI QIDQ4550783zbMATH OpenFDO

Authors Hoang Tuy

Publication date 27 October 2003

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
• An algorithm for indefinite quadratic programming with convex constraints
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints
• scientific article; zbMATH DE number 6310870

Cited in

(3)

• An algorithm for indefinite quadratic programming with convex constraints
• A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
• A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints

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 Q4550783)