@inbook{aecb7a7707d542bea0fa5e0595fff088,
title = "Polynomially solvable cases of binary quadratic programs",
abstract = "We summarize in this chapter polynomially solvable subclasses of binary quadratic programming problems studied in the literature and report some new polynomially solvable subclasses revealed in our recent research. It is well known that the binary quadratic programming program is NP-hard in general. Identifying polynomially solvable subclasses of binary quadratic programming problems not only offers theoretical insight into the complicated nature of the problem but also provides platforms to design relaxation schemes for exact solution methods. We discuss and analyze in this chapter six polynomially solvable subclasses of binary quadratic programs, including problems with special structures in the matrix Q of the quadratic objective function, problems defined by a special graph or a logic circuit, and problems characterized by zero duality gap of the SDP relaxation. Examples and geometric illustrations are presented to provide algorithmic and intuitive insights into the problems.",
keywords = "Binary quadratic programming, Lagrangian dual, Logic circuit, Polynomial solvability, SDP relaxation, Seriesparallel graph",
author = "Duan Li and Xiaoling Sun and Shenshen Gu and Jianjun Gao and Liu, {Chun Li}",
year = "2010",
doi = "10.1007/978-0-387-89496-6_11",
language = "English",
isbn = "9780387894959",
series = "Springer Optimization and Its Applications",
publisher = "Springer Science+Business Media",
pages = "199--225",
editor = "ALTANNAR CHINCHULUUN and PARDALOS, {PANOS M.} and RENTSEN ENKHBAT and IDER TSEVEENDORJ",
booktitle = "Optimization and Optimal Control",
}