Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

A Polynomial Time Solvable Algorithm to Binary Quadratic Programming Problems with Q Being a Seven-Diagonal Matrix and Its Neural Network Implementation

Shenshen Gu, Peng Jiao, Rui Cui

Published Jan 1, 2014• 2 citations
Publisher
DOI
10.1007/978-3-319-12436-0_38

Related papers

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

Shenshen Gu, Rui Cui, Peng Jiao

Neurocomputing•Mar 9, 2016•5 citations

Global Optimization of Binary Quadratic Programming: A Neural Network Based Algorithm and Its FPGA Implementation

Shenshen Gu, Xinyi Chen, Lin Wang

Neural Processing Letters•Sep 30, 2019•1 citation

Polynomially Solvable Cases of Binary Quadratic Programs

Duan Li, Xiaoling L. Sun, Shenshen Gu +2 more

Springer optimization and its applications•Jan 1, 2010•16 citations

A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem

Shenshen Gu, Tao Hao, Hanmei Yao

Neurocomputing•Mar 10, 2020•29 citations

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

Eranda Çela, Bettina Klinz, Christophe Meyer

Journal of Combinatorial Optimization•Aug 14, 2006•14 citations

Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix

Shenshen Gu

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 novel algorithms have been proposed in order to improve the efficiency to solve the BQP. In this paper, polynomial algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix is focused by taking advantage of the basic algorithm proposed in. The basic algorithm is firstly reviewed and then this algorithm is modified to solve binary quadratic programming problems with Q being a tri-diagonal. Furthermore, by improving this algorithm, an algorithm is proposed to solve binary quadratic programming problems with Q being a five-diagonal matrix.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2010•4 citations
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 novel algorithms have been proposed in order to improve the efficiency to solve the BQP. In this paper, polynomial algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix is focused by taking advantage of the basic algorithm proposed in. The basic algorithm is firstly reviewed and then this algorithm is modified to solve binary quadratic programming problems with Q being a tri-diagonal. Furthermore, by improving this algorithm, an algorithm is proposed to solve binary quadratic programming problems with Q being a five-diagonal matrix.