A procedure-based heuristic for 0-1 multiple knapsack problems
From MaRDI portal
Publication:1758871
DOI10.1504/IJMOR.2012.046684zbMath1254.90194OpenAlexW2006371937MaRDI QIDQ1758871
Vincent Boyer, Moussa Elkihel, Didier El Baz, Mohamed Esseghir Lalami
Publication date: 16 November 2012
Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijmor.2012.046684
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (8)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ A new upper bound for the multiple knapsack problem ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Solving knapsack problems on GPU ⋮ Upper and lower bounding procedures for the multiple knapsack assignment problem ⋮ Complexity indices for the multidimensional knapsack problem
Uses Software
This page was built for publication: A procedure-based heuristic for 0-1 multiple knapsack problems
