Heuristic sampling: a method for predicting the performance of tree searching programs

Branch and bound algorithm selection by performance prediction

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence

A sampling-based heuristic for tree search applied to grammar induction

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence

Determining if (FC-) (conflict-directed) back jumping visits a given node is NP-hard

Artificial Intelligence

Early Estimates of the Size of Branch-and-Bound Trees

INFORMS Journal on Computing

Estimating search tree size

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2

Combinatorics of Go

CG'06 Proceedings of the 5th international conference on Computers and games

Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs

INFORMS Journal on Computing

An enumeration problem in ordered sets leads to possible benchmarks for run-time prediction algorithms

ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis

Predicting the size of IDA*'s search tree

Artificial Intelligence

Stratified tree search: a novel suboptimal heuristic search algorithm

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems

Predicting the size of depth-first branch and bound search trees

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Heuristic search when time matters

Journal of Artificial Intelligence Research