2013 | OriginalPaper | Chapter
Solution Methods for General Quadratic Programming Problem with Continuous and Binary Variables: Overview
Author : Nguyen Van Thoai
Published in: Advanced Computational Methods for Knowledge Engineering
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The nonconvex quadratic programming problem with continuous and/or binary variables is a typical NP-hard optimization problem, which has a wide range of applications. This article presents an overview of actual solution methods for solving this interesting and important class of programming problems. Solution methods are discussed in the sense of global optimization.