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]
@inproceedings{Gu10-6,
title = {Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix},
author = {Shenshen Gu},
year = {2010},
doi = {10.1109/WCSP.2010.5632199},
url = {https://doi.org/10.1109/WCSP.2010.5632199},
researchr = {https://researchr.org/publication/Gu10-6},
cites = {0},
citedby = {0},
pages = {1-5},
booktitle = {International Conference on Wireless Communications and Signal Processing, WCSP 2010, Suzhou, China, 21-23 October, 2010},
publisher = {IEEE},
isbn = {978-1-4244-7554-4},
}