proposed by | Toby Walsh tw@cs.york.ac.uk |
The problem appears in several other papers.
P. Galinier and J.K. Hao, Solving the progressive party problem by local search. in "Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization", Chapter 29, pp418-432, S. Voss, S. Martello, I.H. Osman and C. Roucairol (Eds.), Kluwer Academic Publishers, 1998.
Organizing a Social Event - A Difficult Problem of Combinatorial Optimisation. Sally C. Brailsford, Peter M. Hubbard, Barbara M. Smith and H. Paul Williams, Computers and Operations Research, 23, pp. 845-856,1996.
Solving Linear Pseudo-Boolean Constraint Problems with Local Search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI-97, Providence, RI, 1997. Postscript, Postscript slides. There is also an unpublished appendix with extended experimental results.
Domain-Independent Local Search for Linear Integer Optimization. PhD dissertation accepted by the Technical Faculty of the University des Saarlandes, in October 1998. (abstract. postscript. compressed postscript)