Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
A new polynomial-time algorithm for linear programming
Combinatorica
Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Integer and combinatorial optimization
Integer and combinatorial optimization
Search in Artificial Intelligence
Search in Artificial Intelligence
Heuristic search in restricted memory (research note)
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Linear-space best-first search
Artificial Intelligence
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
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
Inference methods for a pseudo-boolean satisfiability solver
Eighteenth national conference on Artificial intelligence
Constraint Processing
Finding Cuts in the TSP (A preliminary report)
Finding Cuts in the TSP (A preliminary report)
Combinatorial Auctions
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
Best-first AND/OR search for graphical models
AAAI'07 Proceedings of the 22nd 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
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
On the feasibility of distributed constraint satisfaction
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
AND/OR branch-and-bound for graphical models
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Russian doll search for solving constraint optimization problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Value elimination: bayesian inference via backtracking search
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in 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
| Hi-index | 0.00 |
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-first AND/OR search algorithms to solving 0-1 Integer Linear Programs (0-1 ILP) within this framework. We also include a class of dynamic variable ordering heuristics while exploring an AND/OR search tree for 0-1 ILPs. We demonstrate the effectiveness of these search algorithms on a variety of benchmarks, including real-world combinatorial auctions, random uncapacitated warehouse location problems and MAX-SAT instances.