Mixed-integer quadratic programming is in NP

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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 162; číslo 1-2; s. 225 - 240
Hlavní autoři:	Pia, Alberto Del, Dey, Santanu S., Molinaro, Marco
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2017 Springer Nature B.V
Témata:	Calculus of Variations and Optimal Control; Optimization Combinatorics Complexity theory Economics Feasibility Full Length Paper Inequality Integer programming Lectures Linear programming Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Polynomials Quadratic programming Studies Theoretical Integer programming 90C20 Quadratic programming 90C60 90C11 Complexity
ISSN:	0025-5610, 1436-4646
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!