Constraint satisfaction problems: Algorithms and applications

A constraint satisfaction problem requires a value, selected from a given finite domain, to be assigned to each variable in the problem, so that all constraints relating the variables are satisfied. Many combinatorial problems in operational research, such as schedulling and timetabling, can be formulated as constraint satisfaction problems. Researchers in artificial intelligence usually adopt a constaint satisfaction approach as their prefererd method when tackling such problems. However constraint satisfaction approches are not widely known amongst operational researchers. The aim of this paper is to introduce constraint statisfaction to the operational researchers.

[1]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[2]  Emile H. L. Aarts,et al.  Examination time tabling : a case study for constraint satisfaction , 1994 .

[3]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[4]  Jean-François Puget,et al.  On the Satisfiability of Symmetrical Constrained Satisfaction Problems , 1993, ISMIS.

[5]  Michel Van Caneghem,et al.  Solving Crew Scheduling Problems bu Constraint Programming , 1995, CP.

[6]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[7]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[8]  David L. Waltz,et al.  Generating Semantic Descriptions From Drawings of Scenes With Shadows , 1972 .

[9]  Les G. Proll,et al.  Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem , 1998, INFORMS J. Comput..

[10]  Philippe Baptiste,et al.  A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling , 1995, IJCAI.

[11]  C. Thuriot,et al.  Decision approach to workload distribution , 1994 .

[12]  Pascal Van Hentenryck,et al.  Generality versus Specificity: An Experience with AI and OR Techniques , 1988, AAAI.

[13]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[14]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[15]  Stephen F. Smith,et al.  Applying constraint satisfaction techniques to job shop scheduling , 1997, Ann. Oper. Res..

[16]  Pascal Van Hentenryck,et al.  Solving the Car-Sequencing Problem in Constraint Logic Programming , 1988, ECAI.

[17]  Pedro Barahona,et al.  Heuristics and look-ahead integration to solve constraint satisfaction problems efficiently , 1994, Ann. Oper. Res..

[18]  Evelina Lamma,et al.  Integrating constraint logic programming and operations research techniques for the Crew Rostering Problem , 1998, Softw. Pract. Exp..

[19]  Mark Wallace,et al.  A new approach to integrating mixed integer programming and constraint logicprogramming , 1999, Ann. Oper. Res..

[20]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[21]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[22]  John M. Wilson,et al.  Connections Between Integer Linear Programming and Constraint Logic Programming - An Overview and Introduction to the Cluster of Articles , 1998, INFORMS J. Comput..

[23]  Philippe Baptiste,et al.  Constraint-Based Optimization and Approximation for Job-Shop Scheduling , 1995 .

[24]  I. B. Crabtree.  Resource scheduling: comparing simulated annealing with constraint programming , 1995 .

[25]  David M. Ryan,et al.  The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering , 1992 .

[26]  Pascal Van Hentenryck,et al.  Solving a Cutting-Stock Problem in Constraint Logic Programming , 1988, ICLP/SLP.

[27]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[28]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[29]  Ken Darby-Dowman,et al.  Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming , 1998, INFORMS J. Comput..

[30]  Pascal Van Hentenryck,et al.  Constraint Satisfaction Using Constraint Logic Programming , 1992, Artif. Intell..

[31]  Gyuri Lajos.  Complete University Modular Timetabling Using Constraint Logic Programming , 1995, PATAT.

[32]  Jean-Charles Régin,et al.  A Filtering Algorithm for Global Sequencing Constraints , 1997, CP.

[33]  Pascal Van Hentenryck.  Constraint Solving for Combinatorial Search Problems: A Tutorial , 1995, CP.

[34]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[35]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[36]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[37]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[38]  Alexander Bockmayr,et al.  Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming , 1998, INFORMS J. Comput..

[39]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[40]  Mark Wallace,et al.  Constraint logic programming and its application to fleet scheduling , 1994 .

[41]  Ehl Emile Aarts,et al.  A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .

[42]  Sally C. Brailsford,et al.  The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared , 1995, CP.

[43]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.