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

Celý popis

Podrobná bibliografia

Vydané v:	Neurocomputing (Amsterdam) Ročník 198; s. 171 - 179
Hlavní autori:	Gu, Shenshen, Cui, Rui, Peng, Jiao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 19.07.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!