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

Shenshen Gu. Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix. In International Conference on Wireless Communications and Signal Processing, WCSP 2010, Suzhou, China, 21-23 October, 2010. pages 1-5, IEEE, 2010. [doi]

Abstract

Abstract is missing.