Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix

In the field of signal processing, many problems can be formulated as optimization problems. And most of these optimization problem can be further described in a formal form, that is binary quadratic programming problem(BQP). However, solving the BQP is proved to be NP-hard. Due to this reason, many...

Celý popis

Podrobná bibliografie

Vydáno v:	2010 International Conference on Wireless Communications and Signal Processing s. 1 - 5
Hlavní autor:	Shenshen Gu
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.10.2010
Témata:	Polynomials Programming Quadratic programming Signal processing Signal processing algorithms Symmetric matrices
ISBN:	9781424475568, 1424475562
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!