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

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of global optimization Ročník 48; číslo 3; s. 497 - 508
Hlavní autoři: Lu, Cheng, Wang, Zhenbo, Xing, Wenxun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.11.2010
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. Then an approximation algorithm for the binary quadratic programming problem together with a worst case performance analysis for the algorithm is provided.
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-009-9504-1