Parallel Search Algorithms for Discrete Optimization Problems
From MaRDI portal
Recommendations
Cited in
(16)- Parallel search algorithms in global optimization
- Heuristic allocation based on a dynamic programming state-space representation
- Nagging: A scalable fault-tolerant paradigm for distributed search
- Optimization of sequential-parallel search for objects for the model of the distributed Poisson flow of their appearance
- Parallelizing SATZ using dynamic workload balancing
- Space-Efficient Parallel Algorithms for Combinatorial Search Problems
- Organization of parallel calculations in some problems of discrete optimization
- scientific article; zbMATH DE number 4162301 (Why is no real title available?)
- scientific article; zbMATH DE number 1302197 (Why is no real title available?)
- scientific article; zbMATH DE number 686901 (Why is no real title available?)
- scientific article; zbMATH DE number 1150245 (Why is no real title available?)
- scientific article; zbMATH DE number 1163099 (Why is no real title available?)
- scientific article; zbMATH DE number 2080143 (Why is no real title available?)
- PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION
- Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
- Parallel Combinatorial Optimization with Decision Diagrams
This page was built for publication: Parallel Search Algorithms for Discrete Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4869753)