✦ LIBER ✦

A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs

✍ Scribed by Jeff Linderoth

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 390 KB
Volume: 103
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0582-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and cut algorithm for nonconvex

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

✍ Charles Audet; Pierre Hansen; Brigitte Jaumard; Gilles Savard 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 221 KB

We present a branch and cut algorithm that yields in finite time, a globally ☼-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. The idea is to estimate all quadratic terms by successive linearizations within a bra

A polynomially bounded algorithm for a s

A polynomially bounded algorithm for a singly constrained quadratic program

✍ R. Helgason; J. Kennington; H. Lall 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 194 KB

An efficient branch and bound algorithm

An efficient branch and bound algorithm to solve the quadratic integer programming problem

✍ F. Körner 📂 Article 📅 1983 🏛 Springer Vienna 🌐 English ⚖ 333 KB

Decomposition Methods for Solving Noncon

Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound*

✍ Riccardo Cambini; Claudio Sodini 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 207 KB

Computational aspects of a branch and bo

Computational aspects of a branch and bound algorithm for quadratic zero-one programming

✍ P. M. Pardalos; G. P. Rodgers 📂 Article 📅 1990 🏛 Springer Vienna 🌐 English ⚖ 712 KB

A finite branch-and-bound algorithm for

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

✍ Samuel Burer; Dieter Vandenbussche 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 347 KB