A procedure-based heuristic for 0-1 multiple knapsack problems (Q1758871)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A procedure-based heuristic for 0-1 multiple knapsack problems |
scientific article; zbMATH DE number 6108300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A procedure-based heuristic for 0-1 multiple knapsack problems |
scientific article; zbMATH DE number 6108300 |
Statements
A procedure-based heuristic for 0-1 multiple knapsack problems (English)
0 references
16 November 2012
0 references
Summary: We present a heuristic which derives a feasible solution for the Multiple Knapsack Problem (MKP). The proposed heuristic called RCH, is a recursive method that performs computation on the core of knapsacks. The RCH heuristic is compared with the MTHM heuristic of Martello and Toth. Computational results on randomly generated instances show that the proposed approach gives better gap and smaller restitution times.
0 references
MKP
0 references
multiple knapsack problems
0 references
heuristics
0 references
dynamic programming
0 references
subset sum problem
0 references
operational research
0 references
