Dec 18, 2007 · The aim of this paper is to discuss different branch and bound methods for solving indefinite quadratic programs. In these methods the ...

The aim of this paper is to discuss different branch and bound methods for solving indefinite quadratic programs. In these methods the quadratic objective ...

Dec 18, 2007 · Abstract The aim of this paper is to discuss different branch and bound methods for solving indefinite quadratic programs.

The aim of this paper is to discuss different branch and bound methods for solving indefinite quadratic programs. In these methods the quadratic objective ...

Abstract The aim of this paper is to discuss different branch and bound methods for solving indefinite quadratic programs. In these methods the quadratic ...

A computational comparison of some branch and bound methods for indefinite quadratic programs. Riccardo Cambini e Claudio Sodini. Pisa, Novembre 2006.

We propose a branch-and-bound method for minimizing an indefinite quadratic function over a convex set. The bounding operation is based on a certain ...

Cambini et al. A computational comparison of some branch and bound methods for indefinite quadratic programs. Central European Journal of Operations Research.

Abstract. We propose a branch-and-bound algorithm for solving nonconvex quadratically-constrained quadratic programs. The algo-.

A computational comparison of some branch and bound methods for indefinite quadratic programs. Article. Jun 2008. Riccardo Cambini · Claudio ...