Abstract
Purchase PDF (379 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (1)
Purchase PDF (677 K)
doi:10.1016/S0020-0190(97)00142-7 
Copyright © 1997 Published by Elsevier Science B.V.
An efficient, strongly polynomial, 
-approximation parametric optimization scheme*1
Received 6 June 1996;
revised 21 July 1997.
Communicated by V. Ramachandran
Available online 12 May 1998.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Given a set
, vectors
, an interval
, a fixed 0 <
< 1, and an oracle that, for any 0 < < 1 finds an -approximate solution to problem max{hT x ¦ x 
X} for any
, we present theoretically and practically efficient
-approximation algorithm, for the problem min{ν(λ) ¦ λ [a,b]}, where ν(λ) = max{(c − λd)Tx ¦ x X}. When the elements of the set X are {0, ± 1} vectors, the total number of iterations required by our algorithm is O(n7(log n)4).
Author Keywords: Algorithms; Combinatorial problems; Newton's method
