作者: Christian Blum , Carlos Cotta , Antonio J. Fernández , José E. Gallardo , Monaldo Mastrolilli
DOI: 10.1007/978-3-540-78295-7_4
关键词: Search tree 、 Longest common subsequence problem 、 Branch and bound 、 Combinatorics 、 Memetic algorithm 、 Beam search 、 Metaheuristic 、 Computer science
摘要: An important branch of hybrid metaheuristics concerns the hybridization with branch & bound derivatives. In this chapter we present examples for two different types of hybridization. The …