A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
From MaRDI portal
(Redirected from Publication:652663)
Recommendations
Cites work
- scientific article; zbMATH DE number 49534 (Why is no real title available?)
- scientific article; zbMATH DE number 53884 (Why is no real title available?)
- scientific article; zbMATH DE number 808514 (Why is no real title available?)
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Branch-and-Bound Methods: A Survey
- Future paths for integer programming and links to artificial intelligence
- Migration policies, selection pressure, and parallel evolutionary algorithms
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- Parallel Strategies for Meta-Heuristics
- Parallel processing of discrete problems. Proceedings of a workshop, IMA, Minneapolis, MN, USA, May 12--16, 1997
- Solving combinatorial optimization problems in parallel: methods and techniques
Cited in
(4)
This page was built for publication: A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652663)