The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heurist

• 作 者: Soukaina Laabadi Mohamed Naimi
• 机 构: ENS-HassanIIUniversity,EST-HassanIUniversity
• 出 处: 美国运筹学期刊(英文)
• 发表日期: 2018年5期
• 关键词: 0/1 MULTIDIMENSIONAL KNAPSACK PROBLEM SURVEY Real-World Applications HEURISTICS

The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in logistics, finance, telecommunications and other fields. In the 0/1 MKP, a set of items