Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Specializing Russian Doll Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Bucket elimination for multiobjective optimization problems
Journal of Heuristics
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Principles of Constraint Programming
Principles of Constraint Programming
Preference-based Inconsistency Proving: When the Failure of the Best Is Sufficient
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Multi-Objective Propagation in Constraint Programming
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
In the quest of the best form of local consistency for weighted CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Generic preferences over subsets of structured objects
Journal of Artificial Intelligence Research
Multiobjective optimization using GAI models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Exploiting problem decomposition in multi-objective constraint optimization
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Decision making with multiple objectives using GAI networks
Artificial Intelligence
Efficient approximation algorithms for multi-objective constraint optimization
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Interactive algorithm for multi-objective constraint optimization
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Russian Doll Search (RDS) is a well-known algorithm for combinatorial optimization. In this paper we extend it from mono-objective to multi-objective optimization. We demonstrate its practical applicability in the challenging multiple-orbit SPOT5 instances. Besides being much more efficient than any other alternatives, multi-objective RDS can solve an instance which could not have been solved previously.