Mapping tree-structured combinatorial optimization problems onto parallel computers
From MaRDI portal
Publication:6560206
DOI10.1007/BFB0027120zbMATH Open1543.68439MaRDI QIDQ6560206
Stefan Tschöke, Reinhard Lüling, Burkhard Monien, Alexander Reinefeld
Publication date: 21 June 2024
Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Depth-first iterative-deepening: An optimal admissible tree search
- A minimax algorithm better than alpha-beta?
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- An and-or-graph approach for two-dimensional cutting problems
- Analysis of the generalized dimension exchange method for dynamic load balancing
- An analysis of alpha-beta pruning
- Derivation of a termination detection algorithm for distributed computations
- Optimal orientations of cells in slicing floorplan designs
- TSPLIB—A Traveling Salesman Problem Library
- An Algorithm for Two-Dimensional Cutting Problems
- Branch-and-Bound Methods: A Survey
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
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)
