Linked e-resources
Details
Table of Contents
Part I: Contextual Issues
1. The Generalized Assignment Problem
2. Automatic Design for Matheuristics
Part II: Metaheuristic Hybrids
3. Single Solution Metaheuristics
4. Population-Based metaheuristics
Part III: Original Matheuristics
5. Diving Heuristics
6. Very Large-Scale Neighborhood Search
7. Decomposition Based Heuristics
8. Corridor Method
9. Kernel Search
10. Fore-and-Back.
1. The Generalized Assignment Problem
2. Automatic Design for Matheuristics
Part II: Metaheuristic Hybrids
3. Single Solution Metaheuristics
4. Population-Based metaheuristics
Part III: Original Matheuristics
5. Diving Heuristics
6. Very Large-Scale Neighborhood Search
7. Decomposition Based Heuristics
8. Corridor Method
9. Kernel Search
10. Fore-and-Back.