An improved lower bound and approximation algorithm for binary constrained quadratic programming problem

This paper presents an improved lower bound and an approximation algorithm based on spectral decomposition for the binary constrained quadratic programming problem. To decompose spectrally the quadratic matrix in the objective function, we construct a low rank problem that provides a lower bound. Th...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of global optimization Ročník 48; číslo 3; s. 497 - 508
Hlavní autori:	Lu, Cheng, Wang, Zhenbo, Xing, Wenxun
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.11.2010
Predmet:	Computer Science Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Real Functions Lower bound Quadratic integer programming Spectral decomposition Approximation algorithm
ISSN:	0925-5001, 1573-2916
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!