Advertisement

Specializing Russian Doll Search

  • Pedro Meseguer
  • Martì Sánchez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)

Abstract

Russian Doll Search (RDS) is a clever procedure to solve overconstrained problems. RDS solves a sequence of nested subproblems, where two consecutive subproblems differ in one variable only. We present the Specialized RDS (SRDS) algorithm, which solves the current subproblem for each value of the new variable with respect to the previous subproblem. The SRDS lower bound is superior to the RDS lower bound, which allows for a higher level of value pruning, although more work per node is required. Experimental results on random and real problems show that this extra work is often beneficial, providing substantial savings in the global computational effort.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. S. Affane and H. Bennaceur. A weighted arc consistency technique for Max-CSP. In Proc. of the 13 th ECAI, 209–213, 1998.Google Scholar
  2. 2.
    S. Bistarelli, U. Montanari and F. Rossi. Constraint Solving over Semirings. In Proc. of the 14 th IJCAI, 1995.Google Scholar
  3. 3.
    B. Cabon, S. De Givry, L. Lobjois, T. Schiex and J.P. Warners Radio Link Frequency Assignment Constraints, February 1999, Vol 4, Number 1.Google Scholar
  4. 4.
    E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21–70, 1992.CrossRefMathSciNetGoogle Scholar
  5. 5.
    S. Givry, G. Verfaillie and T. Schiex. Bounding the optimum of constraint optimization problems. In Proc. of the 3 th CP 1997.Google Scholar
  6. 6.
    A.M. Koster, C. P. Hoesel and A. W. Kolen. Optimal solutions for a frequency assignment problem via tree-decomposition. In Lecture Notes in Computer Science, 1665:338–349, 1999.Google Scholar
  7. 7.
    J. Larrosa and P. Meseguer. Exploiting the use of DAC in Max-CSP. In Proc. of the 2 th CP, 308–322, 1996.Google Scholar
  8. 8.
    J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible dac for max-csp. Artificial Intelligence, 107:149–163, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    T. Schiex, H. Fargier and G. Verfaillie. Valued Constraint Satisfaction Problems: hard and easy problems. In Proc. of the 14 th IJCAI, 631–637, 1995.Google Scholar
  10. 10.
    G. Verfaillie, M. Lemaître, and T. Schiex. Russian doll search. In Proc. of the 13 th AAAI, 181–187, 1996.Google Scholar
  11. 11.
    R. Wallace. Directed arc consistency preprocessing. In M. Meyer, editor, Selected papers from the ECAI-94 Workshop on Constraint Processing, number 923 in LNCS, 121–137. Springer, Berlin, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Pedro Meseguer
    • 1
  • Martì Sánchez
    • 1
  1. 1.IIIA-CSICCampus UABBellaterraSpain

Personalised recommendations