MVRC Heuristic for Solving the Multi-Choice Multi-Constraint Knapsack Problem

DOI10.1007/11758501_78MaRDI QIDQ3545046zbMATH OpenOpenAlexFDO

Authors Maria Chantzara, Miltiades Anagnostou

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758501_78

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1728442
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• The multiple-choice multi-period knapsack problem
• New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls

Cited in

(1)

• Hard multidimensional multiple choice knapsack problems, an empirical study

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: MVRC Heuristic for Solving the Multi-Choice Multi-Constraint Knapsack Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545046)