Parallel heuristic search -- introductions and a new approach
From MaRDI portal
Publication:6560213
DOI10.1007/BFB0027125zbMATH Open1543.68438MaRDI QIDQ6560213
Publication date: 21 June 2024
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)
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?)
- Title not available (Why is that?)
- How easy is local search?
- A distributed implementation of simulated annealing for the travelling salesman problem
- Massively parallel tabu search for the quadratic assignment problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Tabu Search—Part I
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Parallel heuristic search -- introductions and a new approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560213)
