A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations

We propose two exact approaches for non-convex quadratic integer minimization subject to linear constraints where lower bounds are computed by considering ellipsoidal relaxations of the feasible set. In the first approach, we intersect the ellipsoids with the feasible linear subspace. In the second...

Celý popis

Podrobná bibliografia

Vydané v:	Operations research letters Ročník 43; číslo 4; s. 384 - 388
Hlavní autori:	Buchheim, Christoph, De Santis, Marianna, Palagi, Laura
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.07.2015
Predmet:	Global optimization Integer programming Quadratic programming Integer programming Quadratic programming Global optimization
ISSN:	0167-6377, 1872-7468
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!