Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Directed Arc Consistency Preprocessing
Constraint Processing, Selected Papers
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Reversible DAC and other improvements for solving Max-CSP
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Computational Optimization and Applications
Earth Observation Satellite Management
Constraints
Partition-Based Lower Bound for Max-CSP
Constraints
The Semidefinite Relaxation of the k -Partition Polytope Is Strong
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Anytime Lower Bounds for Constraint Violation Minimization Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Specializing Russian Doll Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
New Lower Bounds of Constraint Violations for Over-Constrained Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Lower Bounds for Non-binary Constraint Optimization Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Opportunistic Specialization in Russian Doll Search
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Specific Filtering Algorithms for Over-Constrained Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Node and arc consistency in weighted CSP
Eighteenth national conference on Artificial intelligence
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
Solving weighted CSP by maintaining arc consistency
Artificial Intelligence
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Conflict-directed A* and its role in model-based embedded systems
Discrete Applied Mathematics
An efficient estimation function for the crew scheduling problem
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
A Decomposition Technique for Max-CSP
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
On Improving the Scalability of Checking Satisfiability in Probabilistic Description Logics
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Journal of Artificial Intelligence Research
Generic preferences over subsets of structured objects
Journal of Artificial Intelligence Research
Exploiting a common property resource under a fairness constraint: a case study
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
Journal of Artificial Intelligence Research
Russian Doll search with tree decomposition
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Computers and Industrial Engineering
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Exploiting problem decomposition in multi-objective constraint optimization
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Strong formulation for the spot 5 daily photograph scheduling problem
Journal of Combinatorial Optimization
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Solving Talent Scheduling with Dynamic Programming
INFORMS Journal on Computing
A decision theoretic meta-reasoner for constraint optimization
AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
Computers and Operations Research
Computational Optimization and Applications
Hi-index | 0.00 |
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 search by n successive searches on nested subproblems (n being the number of problem variables), records the results of each search and uses them later, when solving larger subproblems, in order to improve the lower bound on the global valuation of any partial assignment. On small random problems and on large real scheduling problems, this algorithm yields surprisingly good results, which greatly improve as the problems get more constrained and the bandwidth of the used variable ordering diminishes.