Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Binary quadratic programming (BQP) is a typical integer programming problem widely applied in the field of signal processing, economy, management and engineering. However, it is NP-hard and lacks efficient algorithms. Due to this reason, in this paper, some novel polynomial algorithms are proposed t...

Full description

Bibliographic Details

Published in:	Neurocomputing (Amsterdam) Vol. 198; pp. 171 - 179
Main Authors:	Gu, Shenshen, Cui, Rui, Peng, Jiao
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 19.07.2016
Subjects:	Algorithms Binary quadratic programming Constraints Dynamic programming Economics Integer programming Management Polynomial time solvable algorithm Polynomials Quadratic programming Signal processing Polynomial time solvable algorithm Binary quadratic programming Dynamic programming
ISSN:	0925-2312, 1872-8286
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!