Laurent Perron

Michael A. Trick

This book constitutes the refereed proceedings of the 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2008, held in Paris, France, in May 2008. The 18 revised long papers and 22 revised short papers presented together with 3 invited talks were carefully reviewed and selected from 130 submissions. The papers describe current research in the fields of constraint programming, artificial intelligence, and operations research to explore ways of solving large-scale, practical optimization problems through integration and hybridization of the fields' different techniques.

5th International Conference, CPAIOR 2008 Paris, France, May 20-23, 2008 Proceedings

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

David S. Johnson

The purpose of a DIMACS Challenge is to encourage and coordinate research in the experimental analysis of algorithms. The First DIMACS Challenge encouraged experimental work in the area of network flow and matchings. This Second DIMACS Challenge, on which this volume is based, took place in conjunction with the DIMACS Special Year on Combinatorial Optimization. Addressed here are three difficult combinatorial optimization problems: finding cliques in a graph, colouring the vertices of a graph, and solving instances of the satisfiability problem. These problems were chosen both for their practical interest and because of their theoretical intractability.

Second DIMACS Implementation Challenge, October 11-13, 1993

Cliques, Coloring, and Satisfiability

The 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008) was held in Paris, France May 20–23, 2008. The purpose of this conference series is to bring together researchers in the ?elds of constraint programming, arti?cial intelligence, and operations research to explore ways of solving large-scale, practical optimization problems through integration and hybridization of the ?elds’ di?erent techniques. Through the years, this research community is discovering that the ?elds have much in c- mon, and there has been tremendous richness in the resulting cross-fertilization of ?elds. This year, we allowed submissions of both long (15 page) and short (5 page) papers, with short papers either being original work, a reduced version of a long paper, or an extended abstract of work published elsewhere. We were not s- prised by the 69 submissions in the long paper category: this is an active ?eld with many researchers. We were surprised by the 61 short paper submissions. This was far more than predicted. With 130 high-quality submissions, compe- tion for acceptance in this year’s program was particularly ?erce. In the end, we accepted 18 long papers and 22 short papers for presentation and publication in this volume.

Michael A. Trick

Books

Your next favorite book is out there