Henz reports runtimes of less than 1 minute, using the finite-domain constraint programming tool Friar Tuck.

Walser reports competitive results using a linear 0-1 formulation and local search methods in his PhD thesis (abstract, postscript, compressed postscript).

Using explicit enumeration and integer programming and explicit enumeration, Nemhauser and Trick report runtimes of the order of 24 hours.