Hybridizations of metaheuristics with branch \& bound derivates

DOI10.1007/978-3-540-78295-7_4MaRDI QIDQ2950520zbMATH OpenOpenAlexFDO

Authors Christian Blum, Carlos Cotta, A. J. Fernández, José E. Gallardo, Monaldo Mastrolilli

Publication date 9 October 2015

Published in Hybrid Metaheuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78295-7_4

zbMATH Keywords

search treememetic algorithmbeam searchgreedy randomize adaptive search proceduretarget node

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1488101
• scientific article; zbMATH DE number 1935510
• Hybrid metaheuristics: an introduction
• Hybrid metaheuristics
• Hybrid metaheuristics. An emerging approach to optimization.

Cites work

• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A Gentle Introduction to Memetic Algorithms
• Algorithms on Strings, Trees and Sequences
• Ant colony optimization.
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• Branch-and-Bound Methods: A Survey
• Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
• Greedy randomized adaptive search procedures
• Improved heuristics and a genetic algorithm for finding short supersequences
• More on the complexity of common superstring and supersequence problems
• Recent advances in memetic algorithms.
• The Complexity of Some Problems on Subsequences and Supersequences
• The consensus string problem for a metric is NP-complete
• Theory and algorithms for plan merging

Cited in

(8)

• scientific article; zbMATH DE number 1488101 (Why is no real title available?)
• scientific article; zbMATH DE number 1935510 (Why is no real title available?)
• Extended prey-predator algorithm with a group hunting scenario
• Branch and bound crossed with GA to solve hybrid flowshops
• A novel dynamic generalized opposition-based grey wolf optimization algorithm
• A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems
• Embedding branch and bound within evolutionary algorithms
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates

This page was built for publication: Hybridizations of metaheuristics with branch \& bound derivates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950520)