Constraint programming has become an important general approach for solving hard combinatorial problems that occur in a number of application domains, such as scheduling and configuration. This volume contains selected papers from the workshop on Constraint Programming and Large Scale Discrete Optimization held at DIMACS. It gives a sense of state-of-the-art research in this field, touching on many of the important issues that are emerging and giving an idea of the major current trends. The topics include new strategies for local search, multithreaded constraint programming, specialized constraints that enhance consistency processing, fuzzy representations, hybrid approaches involving both constraint programming and integer programming, and applications to scheduling problems in domains such as sports scheduling and satellite scheduling.
Introduction to DIMACS workshop on Constraint Programming and Large Scale Discrete Optimization by R. J. Wallace and E. C. Freuder General methods: Using global constraints for local search by A. Nareyek Guided local search joins the elite in discrete optimisation by C. Voudouris and E. Tsang Multithreaded constraint programming: A hybrid approach by F. Zabatta CP approaches to scheduling: Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies by H. Meyer auf'm Hofe A constraint-based approach to satellite scheduling by J. C. Pemberton and F. Galiber, III Minimization of the number of breaks in sports scheduling problems using constraint programming by J.-C. Regin A constraint programming pre-processor for a bus driver scheduling system by B. M. Smith, C. J. Layfield, and A. Wren LSCO and software methodology: Large scale combinatorial optimization: A methodological viewpoint by C. Gervet.