A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
type: Item
instance of: scholarly article
title: A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
zbMATH Open document ID: 1230.90162
author: Yi-Feng Hung
author: Wei-Chih Chen
published in: Journal of Global Optimization
publication date: 2011-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5988560
zbMATH Keywords: hybrid metaheuristic
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: branch-and-bound
zbMATH Keywords: tabu search
zbMATH Keywords: cooperative parallel search
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: s10898-010-9626-5
OpenAlex ID: W2033699305
cites work: Branch-and-Bound Methods: A Survey
cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Parallel Strategies for Meta-Heuristics
cites work: Q4004079
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: Migration policies, selection pressure, and parallel evolutionary algorithms
cites work: Q3998294
cites work: Q4852780
cites work: Parallel processing of discrete problems. Proceedings of a workshop, IMA, Minneapolis, MN, USA, May 12--16, 1997
cites work: Solving combinatorial optimization problems in parallel: methods and techniques
cites work: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
DOI: 10.1007/S10898-010-9626-5
description: scientific article; zbMATH DE number 5988560