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

Neurocomputing

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

Shenshen Gu, Rui Cui, Peng Jiao

Published Mar 9, 2016• 5 citations
Publisher
DOI
10.1016/j.neucom.2015.09.130

Related papers

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•15 citations

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

Lecture notes in computer science•Jan 1, 2014•2 citations

Approximation Algorithm for A Mixed Binary Quadratically Constrained Quadratic Programming Problem

Zi Li Xu, Mingyi Hong

•Jan 1, 2015•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

An improved lower bound and approximation algorithm for binary constrained quadratic programming problem

Cheng Zhu Lu, Zhenbo Wang, Wenxun Xing

Journal of Global Optimization•Dec 17, 2009•6 citations

Computing Local Optima in Quadratic Unconstrained Binary Optimization Problems in Randomized Polynomial Time

Lunshan Gao

•Jan 1, 2024•0 citations