Mixed-integer quadratic programming is in NP
Mixed-integer quadratic programming is in NP
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Subjects
More information
Scope and Contents
Contents
Mixed-integer quadratic programming
is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete. This is established by showing...
Alternative Titles
Full title
Mixed-integer quadratic programming is in NP
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1884114924
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1884114924
Other Identifiers
ISSN
0025-5610
E-ISSN
1436-4646
DOI
10.1007/s10107-016-1036-0
