Applied Partial Constraint Satisfaction Using Weighted Iterative Repair
暂无分享,去创建一个
[1] Jimmy Ho-Man Lee,et al. A constraint-based nurse rostering system using a redundant modeling approach , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.
[2] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[3] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[4] Eugene C. Freuder,et al. Heuristic Methods for Over-Constrained Constraint Satisfaction Problems , 1995, Over-Constrained Systems.
[5] Bjørn N. Freeman-Benson,et al. Constraint hierarchies , 1987, OOPSLA '87.
[6] Joanne L. Martin,et al. A Retrospective , 1988 .
[7] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[8] Gustave J. Rath,et al. Nurse Scheduling Using Mathematical Programming , 1976, Oper. Res..
[9] Richard J. Wallace,et al. Partial Constraint Satisfaction , 1989, IJCAI.
[10] David Abramson,et al. A very high speed architecture for simulated annealing , 1992, Computer.
[11] D. Michael Warner,et al. Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach , 1976, Oper. Res..
[12] Abdul Sattar,et al. An Integer Programming-Based Nurse Rostering System , 1996, ASIAN.
[13] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[14] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..