A Hybrid Metaheuristic for the Longest Common Subsequence Problem | p. 1 |
Hybrid Algorithms for the Variable Sized Bin Packing Problem | p. 16 |
A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model | p. 31 |
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem | p. 46 |
A New Approach for Solving the Generalized Traveling Salesman Problem | p. 62 |
Hybrid Heuristic for Dynamic Resources-Constrained Project Scheduling Problem | p. 73 |
A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem | p. 88 |
A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents | p. 103 |
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem | p. 118 |
An Improved Memetic Algorithm for Break Scheduling | p. 133 |
Consultant-Guided Search Algorithms for the Quadratic Assignment Problem | p. 148 |
On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem | p. 160 |
Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem | p. 174 |
SearchCol: Metaheuristic Search by Column Generation | p. 190 |
Survey: Matheuristics for Rich Vehicle Routing Problems | p. 206 |
Author Index | p. 223 |
Table of Contents provided by Ingram. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.