Download bibtex

The problem was proposed in [Smith95Constraint]. A revised version appears in [Smith96theprogressive].

More information on [Walser97Solving] can be found in slides and an appendix.

[Galinier99Solving]
Philippe Galinier and Jin-Kao Hao
Solving the progressive party problem by local search.
Meta-heuristics. Advances and trends in local search paradigms for optimization. 2nd Meta-Heuristics international conference (MIC-97), Sophia-Antipolis, France, July 21-24, 1997, 419-432, 1999

[WalserThesis:98]
Joachim Paul Walser
Domain-Independent Local Search for Linear Integer Optimization
Ph.D. thesis, {Universität des Saarlandes, Fachbereich Informatik} oct 1998

[Walser97Solving]
Joachim P. Walser
Solving Linear Pseudo-Boolean Constraint Problems with Local Search
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, AAAI 97, IAAI 97, July 27-31, 1997, Providence, Rhode Island, 269-274, 1997

[Smith96theprogressive]
B.M.Smith, S.C.Brailsford, P.M.Hubbard H.P.Williams, and H P Williams
The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared
Constraints, 119–138, 1996

[Brailsford96Organizing]
Sally C. Brailsford, Peter M. Hubbard, Barbara M. Smith, and H. Paul Williams
Organizing a social event - A difficult problem of combinatorial optimization
Computers {&} OR, 845-856, 1996

[Smith95Constraint]
P M Hubbard & H P Williams Barbara M Smith
The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared
Technical Report 95.8, University of Leeds, 1995