Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem

Jakob Puchinger, Günther Raidl, Martin Gruber
January 2005
PDF bib

Abstract

Full Citation:

Jakob Puchinger, Günther R. Raidl, Martin Gruber. Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem. Proceedings of MIC2005, the 6th Metaheuristics International Conference, pages 775-780, 2005.

Type
Conference Paper
Evolcomp Hybrid
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.