@techreport{f63bfe23904e4d7a867788492a806556,

title = "A Linear Programming Reformulation of the Standard Quadratic Optimization Problem",

abstract = "The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO).It is NPhard, and contains the maximum stable set problem in graphs as a special case.In this note we show that the SQO problem may be reformulated as an (exponentially sized) linear program.",

keywords = "linear programming, standard quadratic optimization, positive polynomials",

author = "{de Klerk}, E. and D.V. Pasechnik",

note = "Pagination: 12",

year = "2005",

language = "English",

volume = "2005-24",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}