The following pages link to (Q4394588):
Displaying 18 items.
- Parallelization strategies for rollout algorithms (Q812417) (← links)
- Metaheuristic downhill simplex method in combinatorial optimization (Q941194) (← links)
- Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
- An analysis of parallel heuristics for task allocation in multicomputers (Q1377284) (← links)
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. (Q1416301) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- The parallel search bench ZRAM and its applications (Q1808187) (← links)
- Morph-based local-search heuristics for large-scale combinatorial data analysis (Q1963866) (← links)
- On parallelizing a greedy heuristic for finding small dominant sets (Q2366651) (← links)
- A first multilevel cooperative algorithm for capacitated multicommodity network design (Q2489307) (← links)
- Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
- Strategies for the parallel implementation of metaheuristics (Q2776561) (← links)
- Space-Efficient Parallel Algorithms for Combinatorial Search Problems (Q2849956) (← links)
- Parallel Hybrid Metaheuristics (Q3424838) (← links)
- Parallel Solution Methods for Vehicle Routing Problems (Q3564355) (← links)
- Batched dynamic solutions to decomposable searching problems (Q3707419) (← links)
- The parallel complexity of TSP heuristics (Q4729351) (← links)
- Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286) (← links)
