Hybrid Metaheuristics 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, Proceedings

A Hybrid Metaheuristic for the Longest Common Subsequence Problem.- Hybrid Algorithms for the Variable Sized Bin Packing Problem.- A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model.- A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem.- A New Approach for Solving the Generalized Traveling Salesman Problem.- Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem.- A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem.- A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents.- New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem.- An Improved Memetic Algorithm for Break Scheduling.- Consultant-Guided Search Algorithms for the Quadratic Assignment Problem.- On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem.- Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem.- SearchCol: Metaheuristic Search by Column Generation.- Survey: Matheuristics for Rich Vehicle Routing Problems.