A procedure-based heuristic for 0-1 Multiple Knapsack Problems Online publication date: Wed, 02-May-2012
by Mohamed Esseghir Lalami; Moussa Elkihel; Didier El Baz; Vincent Boyer
International Journal of Mathematics in Operational Research (IJMOR), Vol. 4, No. 3, 2012
Abstract: In this paper, 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.
Online publication date: Wed, 02-May-2012
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com