Russian Doll Search for Solving Constraint Optimization Problems

@inproceedings{Verfaillie1996RussianDS,
  title={Russian Doll Search for Solving Constraint Optimization Problems},
  author={G{\'e}rard Verfaillie and Michel Lema{\^i}tre and Thomas Schiex},
  booktitle={AAAI/IAAI, Vol. 1},
  year={1996}
}
If the Constraint Satisfaction framework has been extended to deal with Constraint Optimization problems, it appears that optimization is far more complex than satisfaction. One of the causes of the inefficiency of complete tree search methods, like Depth First Branch and Bound, lies in the poor quality of the lower bound on the global valuation of a partial assignment, even when using Forward Checking techniques. In this paper, we introduce the Russian Doll Search algorithm which replaces one… CONTINUE READING
79 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 79 extracted citations

Similar Papers

Loading similar papers…