Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Principles of artificial intelligence
Principles of artificial intelligence
Integer and combinatorial optimization
Integer and combinatorial optimization
Heuristic search in restricted memory (research note)
Artificial Intelligence
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
AND/OR search spaces for graphical models
Artificial Intelligence
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Memory intensive branch-and-bound search for graphical models
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Taking advantage of stable sets of variables in constraint satisfaction problems
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
An algorithm for optimal winner determination in combinatorial auctions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A hybrid approach for the 0-1 multidimensional knapsack problem
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
AND/OR branch-and-bound for graphical models
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
AND/OR branch-and-bound search for pure 0/1 integer linear programming problems
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Algorithms for generating ordered solutions for explicit and/or structures
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. In this paper we introduce an AND/OR search algorithm that explores a context-minimal AND/OR search graph in a best-firstmanner for solving 0/1 Integer Linear Programs (0/1 ILP). We also extend to the 0/1 ILP domain the depth-firstAND/OR Branch-and-Bound search with caching algorithm which was recently proposed by [1] for solving optimization tasks in graphical models. The effectiveness of the best-first AND/OR search approach compared to depth-first AND/OR Branch-and-Bound search is demonstrated on a variety of benchmarks for 0/1 ILPs, including instances from the MIPLIB library, real-world combinatorial auctions, random uncapacitated warehouse location problems and MAX-SAT instances.