Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Algorithms, A Dropbox Challenge and Dynamic Programming.
So, we seek x(i) to solve
min ( x(1) a(1) + x(2) a(2) + ... + x(n) a(n) )^2 x(1) + x(2) + ... + x(n) >= 0 subject to x(i) = 0, 1
So for a reasonably practical solution, omit the 0-1 constraint and attack the problem as just a quadratic program.
Then for the 0-1 constraint, do standard branch and bound.
There are no comments on this comment yet.
So, we seek x(i) to solve
So this is a 0-1 integer quadratic program with one linear constraint.So for a reasonably practical solution, omit the 0-1 constraint and attack the problem as just a quadratic program.
Then for the 0-1 constraint, do standard branch and bound.