A procedure-based heuristic for 0-1 multiple knapsack problems (Q1758871): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1504/ijmor.2012.046684 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2006371937 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:14, 30 July 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