Skip to main navigation Skip to search Skip to main content

Progress on the progressive party problem

  • Helmut Simonis

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

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].

Original languageEnglish
Title of host publicationIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 6th International Conference, CPAIOR 2009, Proceedings
Pages328-329
Number of pages2
DOIs
Publication statusPublished - 2009
Event6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2009 - Pittsburgh, PA, United States
Duration: 27 May 200931 May 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5547 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2009
Country/TerritoryUnited States
CityPittsburgh, PA
Period27/05/0931/05/09

Fingerprint

Dive into the research topics of 'Progress on the progressive party problem'. Together they form a unique fingerprint.

Cite this