People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem
Jakob Puchinger
,
Günther Raidl
,
Martin Gruber
January 2005
PDF
Cite
Type
Conference Paper
Evolcomp
Hybrid
Günther Raidl
Günther Raidl is a Professor at the Algorithms and Complexity Group.
Cite
×