- Series
- ACO Student Seminar
- Time
- Wednesday, October 1, 2008 - 1:30pm for 2 hours
- Location
- ISyE Executive Classroom
- Speaker
- Daniel Dadush – ACO, Georgia Tech
- Organizer
- Annette Rohrs
Constraint Programming is a powerful technique developed by the Computer Science community to solve combinatorial problems. I will present the model, explain constraint propagation and arc consistency, and give some basic search heuristics. I will also go through some illustrative examples to show the solution process works.