×
Feb 29, 1988 · The global minimization of large-scale concave quadratic problems over a bounded polyhedral set using a parallel branch and bound approach ...
The global minimization of large-scale concave quadratic problems over a bounded polyhedral set using a parallel branch and bound approach is considered.
The global minimization of large-scale concave quadratic problems over a bounded polyhedral set using a parallel branch and bound approach is considered.
A parallel branch and bound approach is applied to the problem of finding the global minimum of large-scale concave and indefinite quadratic functions ...
Oct 22, 2024 · In this article, we consider the concave quadratic programming problem which is known to be NP hard. Based on the improved global optimality ...
We present an algorithm for the global minimization of a quadratic function ψ(x, y) = −½xTQx + hTx + dTy, over a polytope Ω = {(x, y) ∈ ℝn+k: Ax + By ≤ b ...
This equivalence allows the parallel algorithm presented for finding the global minimum of concave quadratic functions to be applied directly to solve the LCP.
The global minimization of large-scale concave quadratic problems over a bounded polyhedral set using a parallel branch and bound approach is considered and ...
ROSEN? We present an algorithm for the global minimi7ation of a quadratic function {4(x, y)=. -xTQx + ...
Raghavachari [35] formulates the zero-one linear programming as a concave programming with a quadratic objective function (also see Charnes and Cooper [9] and ...
Missing: parallel | Show results with:parallel