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á bibliografia

Vydané v:	2010 International Conference on Wireless Communications and Signal Processing s. 1 - 5
Hlavný autor:	Shenshen Gu
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2010
Predmet:	Polynomials Programming Quadratic programming Signal processing Signal processing algorithms Symmetric matrices
ISBN:	9781424475568, 1424475562
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!