Multiple stack branch and bound

Multiple stack branch and bound

0.00 Avg rating0 Votes
Article ID: iaor19951114
Country: United States
Volume: 37
Issue: 1
Start Page Number: 43
End Page Number: 48
Publication Date: Jan 1991
Journal: Information Processing Letters
Authors: , , ,
Keywords: programming: travelling salesman
Abstract:

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 travelling salesman problem.

Reviews

Required fields are marked *. Your email address will not be published.