• Corpus ID: 18967750

Russian Doll Search for Solving Constraint Optimization Problems

  title={Russian Doll Search for Solving Constraint Optimization Problems},
  author={G{\'e}rard Verfaillie and Michel Lema{\^i}tre and T. Schiex},
  booktitle={AAAI/IAAI, Vol. 1},
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… 

Figures from this paper

Successive search method for valued constraint satisfaction and optimization problems

  • M. TounsiP. David
  • Computer Science
    Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001
  • 2001
A new method based on Russian Doll Search for solving optimization problems expressed as Valued Constraint Satisfaction Problems (VCSPs) by replacing one search by n successive searches on nested subproblems using the results of each search to produce a better lower bound.

Search Space Reduction and Russian Doll Search

A new Russian Doll Search algorithm, ORDS, which works on objective variables with dynamic variable ordering and demonstrates using the hard Still-Life optimization problem the benefits of changing to the objective function model and ORDS.

Adding Flexibility to Russian Doll Search

This paper presents two BB-based algorithms and empirically demonstrates that the WCSP solver combining the above two algorithms outperforms both RDS and MDAC, over all the problem domains and instances the authors studied.

Russian Doll Search with Tree Decomposition

The algorithm obtained generalizes both RDS and tree-decomposition based algorithms such as BTD or AND-OR Branch and Bound and is studied to study its efficiency on different problems.

Pseudo-tree Search with Soft Constraints

PT-BB is introduced, a branch-and-bound algorithm that performs efficient pseudo-tree search that can improve over loose global upper bounds and combines nicely with russian doll search, producing an interesting algorithm.

Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms

A memetic algorithm is presented in which bucket elimination is used as a mechanism for recombining solutions, providing the best possible child from the parental set, and it is shown that this proposal provides new best known solutions for very large instances.

Algorithms for Constraint Satisfaction Problems Master

An iterative repair search algorithm is introduced, a revised and formalized version of the algorithm first introduced for the needs of a real-life large-scale university timetabling problem, devoted to tightly constrained problems.

Lagrangian Decomposition via Sub-problem Search

A Lagrangian decomposition method where the sub-problems are solved via search rather than through a specialized propagator, which has the benefit that the method can be applied to a much wider range of problems.

Constraint Programming

Extending Dynamic Backtracking to Solve Weighted Conditional CSPs

This paper extends Dynamic Backtracking and similar backjumping-based CSP search algorithms to solve WCCSPs by utilizing activity constraints and soft constraints in order to quickly prune infeasible and suboptimal regions of the search space.



Directed Arc Consistency Preprocessing

  • R. Wallace
  • Computer Science
    Constraint Processing, Selected Papers
  • 1995
This work describes a family of strategies based on directed arc consistency testing during preprocessing that retain the benefits of full arc consistency checking, while improving lower bound calculations.

Increasing Tree Search Efficiency for Constraint Satisfaction Problems

Partial Constraint Satisfaction

Valued Constraint Satisfaction Problems: Hard and Easy Problems

A simple algebraic framework is considered, related to Partial Constraint Satisfaction, which subsumes most of these proposals and is used to characterize existing proposals in terms of rationality and computational complexity.

Depth-First Iterative-Deepening: An Optimal Admissible Tree Search

  • R. Korf
  • Computer Science
    Artif. Intell.
  • 1985

Contradicting Conventional Wisdom in Constraint Satisfaction

Evidence contradicting both pieces of conventional wisdom is presented, and renewed consideration of an approach which fully maintains arc consistency during backtrack search is suggested.

Some Applications of Graph Bandwidth to Constraint Satisfaction Problems

Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic structure of a

Constraint Solving over Semirings

A constraint solving framework where all such extensions, as well as classical CSPs, can be cast, and this framework can be used to model both old and new constraint solving schemes, allowing one to formally justify many informally taken choices in existing schemes.

The Phase Transition and the Mushy Region in Constraint Satisfaction Problems

Exact and Approximate Methods for the Daily Management of an Earth Observation Satellite

  • Proc. of the 5th ESA Workshop on Artificial Intelligence and Knowledge Based Systems for Space.
  • 1995