Multiple stack branch and bound

DOI10.1016/0020-0190(91)90248-GMaRDI QIDQ922704zbMATH OpenFDO

Authors U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. De Sarkar

Publication date 1991

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmbranch and bounddesign of algorithmstree searchEuclidean traveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)

Recommendations

• Simple approaches to parallel branch and bound
• scientific article; zbMATH DE number 646750
• scientific article; zbMATH DE number 934536
• Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
• scientific article; zbMATH DE number 764414

Cites work

• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• Approximate Traveling Salesman Algorithms

Cited in

(5)

• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• scientific article; zbMATH DE number 1935510 (Why is no real title available?)
• An efficient data structure for branch-and-bound algorithm
• Stackelberg Max Closure with Multiple Followers
• Parallel processing for difficult combinatorial optimization problems

This page was built for publication: Multiple stack branch and bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922704)