Mapping tree-structured combinatorial optimization problems onto parallel computers

DOI10.1007/BFB0027120MaRDI QIDQ6560206zbMATH OpenFDO

Authors Reinhard Lüling, Burkhard Monien, Alexander Reinefeld, Stefan Tschöke

Publication date 21 June 2024

Full work available at URL https://doi.org/10.1007/BFB0027120

Mathematics Subject Classification ID

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

Cites work

• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A minimax algorithm better than alpha-beta?
• An Algorithm for Two-Dimensional Cutting Problems
• An analysis of alpha-beta pruning
• An and-or-graph approach for two-dimensional cutting problems
• Analysis of the generalized dimension exchange method for dynamic load balancing
• Branch-and-Bound Methods: A Survey
• Depth-first iterative-deepening: An optimal admissible tree search
• Derivation of a termination detection algorithm for distributed computations
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 49534 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 808514 (Why is no real title available?)
• scientific article; zbMATH DE number 839542 (Why is no real title available?)
• Optimal orientations of cells in slicing floorplan designs
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• TSPLIB—A Traveling Salesman Problem Library

This page was built for publication: Mapping tree-structured combinatorial optimization problems onto parallel computers

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