New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
From MaRDI portal
Publication:2474698
DOI10.1504/IJOR.2007.014176zbMath1170.90468OpenAlexW2037230748WikidataQ126239877 ScholiaQ126239877MaRDI QIDQ2474698
Chaitr S. Hiremath, Raymond R. Hill
Publication date: 6 March 2008
Published in: International Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijor.2007.014176
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
This page was built for publication: New greedy heuristics for the multiple-choice multi-dimensional knapsack problem