2013 | OriginalPaper | Buchkapitel
Solution Methods for General Quadratic Programming Problem with Continuous and Binary Variables: Overview
verfasst von : Nguyen Van Thoai
Erschienen in: Advanced Computational Methods for Knowledge Engineering
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.