Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Tree search and ARC consistency in constraint satisfaction algorithms
Search in Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
In search of the best constraint satisfaction search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Arc-consistency and arc-consistency again
Artificial Intelligence
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Maintaining reversible DAC for Max-CSP
Artificial Intelligence
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
A general scheme for automatic generation of search heuristics from specification dependencies
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Nonserial Dynamic Programming
Radio Link Frequency Assignment
Constraints
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
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
Lower Bounds for Non-binary Constraint Optimization 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
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Russian doll search for solving constraint optimization problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A scheme for approximating probabilistic inference
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
A logical approach to efficient Max-SAT solving
Artificial Intelligence
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Decomposition Technique for Max-CSP
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Local search for optimal global map generation using mid-decadal landsat images
IAAI'08 Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3
Journal of Artificial Intelligence Research
Cutset sampling for Bayesian networks
Journal of Artificial Intelligence Research
A structural approach to reasoning with quantified Boolean formulas
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Global propagation of practicability constraints
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Using relaxations in maximum density still life
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Learning to integrate deduction and search in reasoning about quantified boolean formulas
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Planning solar array operations on the international space station
ACM Transactions on Intelligent Systems and Technology (TIST)
A complete solution to the Maximum Density Still Life Problem
Artificial Intelligence
Resolution procedures for multiple-valued optimization
Information Sciences: an International Journal
Variable elimination in binary CSP via forbidden patterns
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Improving combinatorial optimization: extended abstract
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
There are two main solving schemas for constraint satisfaction and optimization problems: i) search, whose basic step is branching over the values of a variables, and ii) dynamic programming, whose basic step is variable elimination. Variable elimination is time and space exponential in a graph parameter called induced width, which renders the approach infeasible for many problem classes. However, by restricting variable elimination so that only low arity constraints are processed and recorded, it can be effectively combined with search, because the elimination of variables may reduce drastically the search tree size.In this paper we introduce BE-BB(k), a hybrid general algorithm that combines search and variable elimination. The parameter k controls the tradeoff between the two strategies. The algorithm is space exponential in k. Regarding time, we show that its complexity is bounded by k and a structural parameter from the constraint graph. We provide experimental evidence that the hybrid algorithm can outperform state-of-the-art algorithms in constraint satisfaction, Max-CSP and Weighted CSP. Especially in optimization tasks, the advantage of our approach over plain search can be overwhelming.