Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Proceedings
Jean-Charles Régin, Michel Rueher
Springer, May 27, 2004 - Constraints (Artificial intelligence) - 415 pages
This book constitutes the refereed proceedings of the First International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2004, held in Nice, France in April 2004. The 23 revised full papers and 7 revised short papers presented together with an invited talk were carefully reviewed and selected from 56 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming.
What people are saying - Write a review
We haven't found any reviews in the usual places.
A New Exact Solution Algorithm for the Job Shop Problem
19 other sections not shown
activity aircraft approach arc-consistency Artificial Intelligence assignment backtracking Benders cut Benders decomposition binary Branch and Bound BT+CS column combinatorial components computational configurations consistency constraint logic programming Constraint Programming constraint propagation constraint satisfaction constraint satisfaction problem convex cost CPAIOR CPLEX defined demand disjunction domain echelon edge example feasible solution Fibonacci Heap filtering algorithm flight flow formulation global constraint heuristic hybrid implementation infeasible integer programming iteration labels Latin squares Lemma linear linked logic LP relaxation makespan master problem method MILP minimal node objective function operations optimal solution optimisation optimization problems path performance precedence constraints probing problem instances pure algorithm reachability Regin relaxation routing satisfied scheduling problems search tree sequence solve solver step stocking point straint strongly connected components subproblem subset super solution symmetric tasks techniques tuple unassigned variables vehicle vertex vertices violated Xpress-MP