Multiple stack branch and bound

DOI10.1016/0020-0190(91)90248-GzbMath0711.68050MaRDI QIDQ922704

U. K. Sarkar, S. C. de Sarkar, Sujoy Ghose, Partha Pratim Chakrabarti

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)

Related Items

Reducing reexpansions in iterative-deepening search by controlling cutoff bounds, Parallel processing for difficult combinatorial optimization problems

Cites Work

• Approximate Traveling Salesman Algorithms
• Unnamed Item