Multiple stack branch and bound

Sarkar, U. K. ; Chakrabarti, P. P. ; Ghose, S. ; De Sarkar, S. C. (1991) Multiple stack branch and bound Information Processing Letters, 37 (1). pp. 43-48. ISSN 0020-0190

Full text not available from this repository.

Official URL:

Related URL:


A multiple stack branch and bound (MSBB) algorithm which uses a multiple stack data structure in order to reduce the overhead of selecting the most promising node in a best first search scheme is presented. A variation of the algorithm MSBB is presented for providing an approximate solution with any prescribed bound on its cost of solution. Experiments were performed with the Euclidean traveling salesman problem.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
Keywords:Design of Algorithms; Tree Search; A*; Branch and Bound; Approximation Algorithm; Euclidean Traveling Salesman Problem
ID Code:5955
Deposited On:19 Oct 2010 10:04
Last Modified:20 May 2011 09:51

Repository Staff Only: item control page