Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Hybrid Metaheuristics: 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, Proceedings > New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem
Hybrid Metaheuristics: 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, Proceedings |
Maria José Blesa; Christian Blum; Günther Raidl; Andrea Roli; Michael Sampels
Springer Berlin Heidelberg
Hybrid Metaheuristics: 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, Proceedings
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem
Authors

Saïd Hanafi; Jasmina Lazić; Nenad Mladenović; Christophe Wilbaut; Igor Crévits

ARI Id

1664710569489_2854231

Access

Not Available Free

Pages

118-132

DOI

10.1007/978-3-642-16054-7_9

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-16054-7_9

Table of Contents of Book
Showing 1 to 17 of 17 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
A Hybrid Metaheuristic for the Longest Common Subsequence Problem
Manuel Lozano; Christian Blum
1-15
Hybrid Algorithms for the Variable Sized Bin Packing Problem
Christian Blum; Vera Hemmelmayr; Hugo Hernández; Verena Schmid
16-30
A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model
Hande Küçükaydın; Necati Aras; İ. Kuban Altınel
31-45
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
Luca Di Gaspero; Johannes Gärtner; Nysret Musliu; Andrea Schaerf; Werner Schafhauser; Wolfgang Slany
46-61
A New Approach for Solving the Generalized Traveling Salesman Problem
P. C. Pop; O. Matei; C. Sabo
62-72
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem
André Renato Villela da Silva; Luiz Satoru Ochi
73-87
A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem
Viet-Phuong Nguyen; Christian Prins; Caroline Prodhon
88-102
A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents
Christian Schauer; Matthias Prandtstetter; Günther R. Raidl
103-117
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem
Saïd Hanafi; Jasmina Lazić; Nenad Mladenović; Christophe Wilbaut; Igor Crévits
118-132
An Improved Memetic Algorithm for Break Scheduling
Magdalena Widl; Nysret Musliu
133-147
Consultant-Guided Search Algorithms for the Quadratic Assignment Problem
Serban Iordache
148-159
On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem
Johannes Strodl; Karl F. Doerner; Fabien Tricoire; Richard F. Hartl
160-173
Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem
Sandro Pirkwieser; Günther R. Raidl
174-189
SearchCol: Metaheuristic Search by Column Generation
Filipe Alvelos; Amaro de Sousa; Dorabella Santos
190-205
Survey: Matheuristics for Rich Vehicle Routing Problems
Karl F. Doerner; Verena Schmid
206-221
Back Matter
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 17 of 17 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings