Hybrid metaheuristics in combinatorial optimization: a tutorial
From MaRDI portal
(Redirected from Hybrid metaheuristics in combinatorial optimization: a tutorial)
Recommendations
- Hybrid metaheuristics. An emerging approach to optimization.
- Hybrid metaheuristics
- Hybrid metaheuristics: an introduction
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
Cited in
(15)- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1--2, 2010. Proceedings
- Hybrid metaheuristics: an introduction
- Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO
- Hybrid metaheuristics
- Plenary Lecture 1: The blocking meta-heuristics for combinatorial problems solving
- Decomposition based hybrid metaheuristics
- Applications of the DM‐GRASP heuristic: a survey
- The pure parsimony haplotyping problem: overview and computational advances
- scientific article; zbMATH DE number 1054957 (Why is no real title available?)
- scientific article; zbMATH DE number 6863605 (Why is no real title available?)
- A software framework for fast prototyping of meta‐heuristics hybridization
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Hybrid metaheuristics. An emerging approach to optimization.
This page was built for publication: Hybrid metaheuristics in combinatorial optimization: a tutorial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649267)