Local search with constraint propagation and conflict-based heuristics
暂无分享,去创建一个
[1] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances , 1996, CP.
[2] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[3] Christian Prins,et al. Competitive genetic algorithms for the open-shop scheduling problem , 2000, Math. Methods Oper. Res..
[4] Daniele Vigo,et al. A tabu search algorithm for the Open Shop problem , 1997 .
[5] J. Carlier,et al. Adjustment of heads and tails for the job-shop problem , 1994 .
[6] Paul Shaw,et al. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.
[7] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.
[8] Rina Dechter,et al. Dead-End Driven Learning , 1994, AAAI.
[9] Christian Bessiere,et al. Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..
[10] Carmen Gervet,et al. Large combinatorial optimization problem methodology for hybrid models and solutions , 1998, JFPLC.
[11] Teofilo F. Gonzalez,et al. Open Shop Scheduling to Minimize Finish Time , 1976, JACM.
[12] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[13] Olivier Lhomme,et al. Consistency Techniques for Numeric CSPs , 1993, IJCAI.
[14] Nico Roos. ECAI'94 workshop on Constraint Satisfaction Issues Raised by Practical Applications , 1994 .
[15] Narendra Jussien,et al. Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems , 1998, Eur. J. Oper. Res..
[16] F. Glover,et al. In Modern Heuristic Techniques for Combinatorial Problems , 1993 .
[17] David A. McAllester,et al. GSAT and Dynamic Backtracking , 1994, KR.
[18] Patrick Prosser,et al. Domain Filtering can Degrade Intelligent Backtracking Search , 1993, IJCAI.
[19] Patrick Prosser,et al. MAC-CBJ: maintaining arc consistency with conflict-directed backjumping , 1995 .
[20] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[21] Michel Gendreau,et al. A View of Local Search in Constraint Programming , 1996, CP.
[22] Romuald Debruyne,et al. Arc-consistency in dynamic CSPs is no more prohibitive , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.
[23] Patrice Boizumault,et al. Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.
[24] Christian Bessiere,et al. Arc-Consistency in Dynamic Constraint Satisfaction Problems , 1991, AAAI.
[25] Peter J. Stuckey,et al. Extending GENET with lazy arc consistency , 1998, IEEE Trans. Syst. Man Cybern. Part A.
[26] Thomas Schiex,et al. Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).
[27] Philippe David. A Constraint-Based Approach for Examination Timetabling Using Local Repair Techniques , 1997, PATAT.
[28] William J. Cook,et al. A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.
[29] Jacques Carlier,et al. Resource optimization in a TDMA/DSI system - The Eutelsat approach , 1986 .
[30] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[31] Peter Brucker,et al. A Branch & Bound Algorithm for the Open-shop Problem , 1997, Discret. Appl. Math..
[32] Ernest Davis,et al. Constraint Propagation with Interval Labels , 1987, Artif. Intell..
[33] Narendra Jussien. E-constraints: Explanation-based constraint programming , 2001 .
[34] Johan de Kleer,et al. A Comparison of ATMS and CSP Techniques , 1989, IJCAI.
[35] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..
[36] Alain Colmerauer,et al. Constraint logic programming: selected research , 1993 .
[37] Rina Dechter,et al. Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..
[38] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[39] Pascal Van Hentenryck. Improved CLP Scheduling with Task Intervals , 1994 .
[40] Philippe Codognet,et al. A Metalevel Compiler of CLP(FD) and Its Combination with Intelligent Backtracking , 1993, WCLP.
[41] Narendra Jussien,et al. Dynamic Domain Splitting for Numeric CSPs , 1998, ECAI.
[42] Daniel P. Miranker,et al. A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.
[43] Ching-Fang Liaw,et al. A tabu search algorithm for the open shop scheduling problem , 1999, Comput. Oper. Res..
[44] Andrea Schaerf,et al. Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems , 1997, IJCAI.
[45] Ulrich Junker. Conflict Detection for Arbitrary Constraint Propagation Algorithms , 2001 .
[46] Thomas Schiex,et al. Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.
[47] Barry Richards,et al. Non-systematic Search and Learning: An Empirical Study , 1998, CP.
[48] Patrick Prosser,et al. HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..
[49] Vice President,et al. An Introduction to Expert Systems , 1989 .
[50] Steven David Prestwich. A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences , 2000, CP.
[51] P. Langley. Systematic and nonsystematic search strategies , 1992 .
[52] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[53] Makoto Yokoo,et al. Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.
[54] Narendra Jussien,et al. Relaxation de Contraintes pour les problèmes dynamiques , 1997 .
[55] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..
[56] Christelle Guéret,et al. A new lower bound for the open‐shop problem , 1999, Ann. Oper. Res..
[57] Christian Bliek,et al. Generalizing Partial Order and Dynamic Backtracking , 1998, AAAI/IAAI.