You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
Minimization of Half-Products
T. Badics and E. Boros
Mathematics of Operations Research
Vol. 23, No. 3 (Aug., 1998), pp. 649-660
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3690564
Page Count: 12
Preview not available
In this paper a special class of quadratic functions, the so called half-products are considered. It is shown that while the minimization over the set of binary n-vectors for half-products is NP-complete, an ε-approximating solution can be found in polynomial time for any ε > 0.
Mathematics of Operations Research © 1998 INFORMS