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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 48; no. 3; pp. 497 - 508
Main Authors:	Lu, Cheng, Wang, Zhenbo, Xing, Wenxun
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.11.2010
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!