Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Integer and combinatorial optimization
Integer and combinatorial optimization
Search in Artificial Intelligence
Search in 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
Constraint Processing
Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
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
On the space-time trade-off in solving constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A structure-based variable ordering heuristic for SAT
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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
Best-First AND/OR Search for 0/1 Integer Programming
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Best-first AND/OR search for graphical models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
AND/OR multi-valued decision diagrams for constraint optimization
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
AND/OR search spaces have recently been introduced as 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 extend the recently introduced AND/OR Branch-and-Bound algorithm (AOBB) [1] for solving pure 0/1 Integer Linear Programs [2]. Since the variable selection can have a dramatic impact on search performance, we introduce a new dynamic AND/OR Branch-and-Bound algorithm able to accommodate variable ordering heuristics. The effectiveness of the dynamic AND/OR approach is demonstrated on a variety of benchmarks for pure 0/1 integer programming, including instances from the MIPLIB library, real-world combinatorial auctions and random uncapacitated warehouse location problems.