Approximation algorithms for quadratic programming | NOVA. The University of Newcastle's Digital Repository

Home

Description	Size	Format
Author final version	213 KB	Adobe Acrobat PDF	View/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/26824

Title: Approximation algorithms for quadratic programming
Author/Creator: Fu, Minyue; Luo, Z. Q.; Yu, Y.
Description: We consider the problem of approximating the global minimum of a general quadratic pro-gram (QP) with n variables subject to m ellipsoidal constraints.
Relation: Journal of Combinatorial Optimization Vol. 2, Issue 1, p. 29-50
Relation: http://springerlink.metapress.com/content/?mode=boolean&k=au%3a(Fu%2c+Minyue+)&sortorder=asc&v=expanded
Date: 1998
Publisher: Kluwer Academic Publishers
Keyword(s): global minimizer; polynomial-time approximation algorithm; quadratic programming
Resource Type: journal article
Rights: The original publication is available at www.springerlink.com
Identifier: http://hdl.handle.net/1959.13/26824
Identifier: ISSN:1382-6905

21 Visitors

22 Hits

NOVA. The University of Newcastle's Digital Repository