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

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

NeurocomputingMar 9, 20165 citations

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

Eranda Çela, Bettina Klinz, Christophe Meyer

Journal of Combinatorial OptimizationAug 14, 200614 citations

Structured linear reformulation of binary quadratically constrained quadratic programs

Shan Jiang, Shu‐Cherng Fang, Tiantian Nie +1 more

Optimization LettersNov 17, 20181 citation

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

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

arXiv:1911.10877Optimization LettersFeb 19, 20216 citations

The unconstrained binary quadratic programming problem: a survey

Gary A. Kochenberger, Jin‐Kao Hao, Fred Glover +4 more

Journal of Combinatorial OptimizationApr 17, 2014479 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 scienceJan 1, 20142 citations