proposed by | Toby Walsh tw@cs.york.ac.uk |
Walser reports competitive results using a linear 0-1 formulation and local search methods in his PhD thesis (abstract, postscript, compressed postscript).
Henz reports runtimes of less than 1 minute, using the finite-domain constraint programming tool, Friar Tuck.