A procedure-based heuristic for 0-1 multiple knapsack problems (Q1758871): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:34, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A procedure-based heuristic for 0-1 multiple knapsack problems |
scientific article |
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
