Find all the quadruples [a, b, c, d] where a^3 + b^3 = c^3 + d^3 when 1 <= a, b, c or d <= 10000

Looking for an algorithm or some coding hints to find the solutions for

a^3 + b^3 = c^3 + d^3, where a, b, c and d all are in the range [1 .. 10000]

It's an interview question.

I'm thinking priority queues to at least iterate for a and b values. Some hint will be great, will try to work through from there.