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

Springer optimization and its applications

Polynomially Solvable Cases of Binary Quadratic Programs

Duan Li, Xiaoling L. Sun, Shenshen Gu, Jianjun Gao, Chunli Liu

Published Jan 1, 2010• 16 citations
Publisher
DOI
10.1007/978-0-387-89496-6_11

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

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 case of convex integer quadratic programming problems with box integer constraints

Chunli Liu, Jianjun Gao

Journal of Global Optimization•Jan 6, 2015•5 citations

A new polynomially solvable class of quadratic optimization problems with box constraints

Milan Hladík, Michal Černý, Miroslav Rada

arXiv:1911.10877•Optimization Letters•Feb 19, 2021•7 citations

A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs

Wei-An Chen, Zhen Zhu, Nan Kong

Optimization Letters•Mar 8, 2017•4 citations

On duality gap in binary quadratic programming

X. L. Sun, C. L. Liu, Duan Li +1 more

Journal of Global Optimization•Feb 17, 2011•21 citations