M. R. Garey and D. S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness,” WH Freeman & Co., New York, 1979.
has been cited by the following article:
TITLE: Improved Balas and Mazzola Linearization for Quadratic 0-1 Programs with Application in a New CuttingPlane Algorithm
AUTHORS: Wajeb Gharibi
KEYWORDS: Quadratic Program; Integer Program; Linearization; Cutting Plane Algorithm
JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.5 No.4, April 19, 2012
ABSTRACT: Balas and Mazzola linearization (BML) is widely used in devising cutting plane algorithms for quadratic 0-1 programs. In this article, we improve BML by first strengthening the primal formulation of BML and then considering the dual formulation. Additionally, a new cutting plane algorithm is proposed.