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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Neurocomputing (Amsterdam) Jg. 198; S. 171 - 179
Hauptverfasser:	Gu, Shenshen, Cui, Rui, Peng, Jiao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 19.07.2016
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!