Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems

@article{Minton1992MinimizingCA,
  title={Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems},
  author={Steven Minton and Mark D. Johnston and Andrew B. Philips and Philip Laird},
  journal={Artif. Intell.},
  year={1992},
  volume={58},
  pages={161-205}
}
One of the most promising general approaches for solving combinatorial search problems is to generate an initial, suboptimal solution and then to apply local repair heuristics. Techniques based on this approach have met with empirical success on many combinatorial problems, including the traveling salesman and graph partitioning problems[10]. Such techniques also have a long tradition in AI, most notably in problemsolving systems that operate by debugging initial solutions [18, 20]. In this… CONTINUE READING
Highly Influential
This paper has highly influenced 69 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS