A linear programming reformulation of the standard quadratic optimization problem

The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO). It is NP-hard, 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 (exponen...

全面介紹

Saved in:
書目詳細資料
Main Authors: Klerk, Etienne de., Pasechnik, Dmitrii V.
其他作者: School of Physical and Mathematical Sciences
格式: Article
語言:English
出版: 2013
主題:
在線閱讀:https://hdl.handle.net/10356/94850
http://hdl.handle.net/10220/9276
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English

相似書籍