Publication:3491318
From MaRDI portal
DOI<499::AID-NAV3220370405>3.0.CO;2-9 10.1002/1520-6750(199008)37:4<499::AID-NAV3220370405>3.0.CO;2-9zbMath0708.90063MaRDI QIDQ3491318
Publication date: 1990
branch-and-bound; upper and lower bounds; global minimization; large-scale indefinite quadratic problems; bounded polyhedral set; Computational result
65K05: Numerical mathematical programming methods
90C06: Large-scale problems in mathematical programming
90C20: Quadratic programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
68W15: Distributed algorithms
Related Items
Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, Global optimization algorithms for linearly constrained indefinite quadratic problems, Box-constrained quadratic programs with fixed charge variables, Global optimization of fractional programs, Reduction of indefinite quadratic programs to bilinear programs, Parallel computing in nonconvex programming, A reformulation-convexification approach for solving nonconvex quadratic programming problems, A branch-and-reduce approach to global optimization, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
Cites Work
