Skip to main content
SpringerLink
Log in

Progress on the Progressive Party Problem

  • Conference paper
Book cover Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5547))

Abstract

We report new results for solving the progressive party problem with finite domain constraints, which are competitive with the best local search results in the literature.When introduced in [1], the progressive party problem was a show case for finite domain constraint programming, since a solution of the original problem for 6 time periods could be found in 26 minutes with Ilog Solver, while an integer programming model was not successful. Improved results using finite domains were reported in [2]. Since then, alternative solutions using MILP have been proposed, while local search methods have been significantly faster, as well as more stable for given problem variations. The best results (to my knowledge) are from [3].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Brailsford, S., Hubbard, P., Smith, B., Williams, H.: Organizing a social event - a difficult problem of combinatorial optimization. Computers Ops. Res. 23, 845–856 (1996)

    Article  MathSciNet  Google Scholar 

  2. Beldiceanu, N., Bourreau, E., Chan, P., Rivreau, D.: Partial search strategy in CHIP. In: 2nd International Conference on Metaheuristics MIC 1997, Sophia Antipolis, France (1997)

    Google Scholar 

  3. Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press, Boston (2005)

    MATH  Google Scholar 

  4. Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648–662. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Richter, Y., Freund, A., Naveh, Y.: Generalizing alldifferent: The somedifferent constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 468–483. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cork Constraint Computation Centre, University College Cork, Ireland

    Helmut Simonis

Authors
  1. Helmut Simonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, PA 15213, Pittsburgh, USA

    Willem-Jan van Hoeve

  2. Carnegie Mellon University, USA

    John N. Hooker

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simonis, H. (2009). Progress on the Progressive Party Problem. In: van Hoeve, WJ., Hooker, J.N. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2009. Lecture Notes in Computer Science, vol 5547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01929-6_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01929-6_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01928-9

  • Online ISBN: 978-3-642-01929-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation