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

Full description

Bibliographic Details

Published in:	2010 International Conference on Wireless Communications and Signal Processing pp. 1 - 5
Main Author:	Shenshen Gu
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2010
Subjects:	Polynomials Programming Quadratic programming Signal processing Signal processing algorithms Symmetric matrices
ISBN:	9781424475568, 1424475562
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!