proposed by | Holger Hoos hoos@cs.ubc.ca |
Hoos describes the generalization of the problem and its formulation as a CSP and SAT problem in his PhD thesis:
Stochastic Local Search - Methods, Models, Applications (PhD thesis, TU Darmstadt, 1998)
Simonis and Beldiceanu have shown that, using global constraints, CHIP can find one solution without search. Finding all solutions remains more of a challenge.
A note on CSPLIB prob007, by Simonis and Beldiceanu.