A procedure-based heuristic for 0-1 multiple knapsack problems
From MaRDI portal
Publication:1758871
DOI10.1504/IJMOR.2012.046684zbMath1254.90194MaRDI QIDQ1758871
Vincent Boyer, Didier El Baz, Mohamed Esseghir Lalami, Moussa Elkihel
Publication date: 16 November 2012
Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)
heuristics; dynamic programming; operational research; subset sum problem; multiple knapsack problems; MKP
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A binary multiple knapsack model for single machine scheduling with machine unavailability, Solving knapsack problems on GPU, Upper and lower bounding procedures for the multiple knapsack assignment problem
Uses Software