A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
DOI10.1007/S10898-010-9626-5zbMATH Open1230.90162OpenAlexW2033699305MaRDI QIDQ652663FDOQ652663
Authors: Yi-Feng Hung, Wei-Chih Chen 
Publication date: 15 December 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9626-5
Recommendations
combinatorial optimizationtabu searchbranch-and-boundhybrid metaheuristiccooperative parallel search
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Future paths for integer programming and links to artificial intelligence
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Branch-and-Bound Methods: A Survey
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Title not available (Why is that?)
- Migration policies, selection pressure, and parallel evolutionary algorithms
- Parallel Strategies for Meta-Heuristics
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
Cited In (4)
Uses Software
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)
