This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
September 1985 (vol. 11 no. 9)
pp. 922-934
B.W. Wah, Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois
Branch-and-bound algorithms are organized and intelligently structured searches of solutions in a combinatorially large problem space. In this paper, we propose an approximate stochastic model of branch-and-bound algorithms with a best-first search. We have estimated the average memory space required and have predicted the average number of subproblems expanded before the process terminates. Both measures are exponentials of sublinear exponent. In addition, we have also compared the number of subproblems expanded in a best-first search to that expanded in a depth-first search. Depth-first search has been found to have computational complexity comparable to best-first search when the lower-bound function is very accurate or very inaccurate; otherwise, best-fit search is usually better. The results obtained are useful in studying the efficient evaluation of branch-and-bound algorithms in a virtual memory environment. They also confirm that approximations are very effective in reducing the total number of iterations.
Index Terms:
subproblem, Approximations, best-first search, branch-and-bound algorithms, depth-first search, iterations, memory space
Citation:
B.W. Wah, null Chee Fen Yu, "Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search," IEEE Transactions on Software Engineering, vol. 11, no. 9, pp. 922-934, Sept. 1985, doi:10.1109/TSE.1985.232550
Usage of this product signifies your acceptance of the Terms of Use.