Heuristic Algorithms of Multidimensional Knapsack Problem
The multidimensional knapsack problem is an NP-hard combinatorial optimization problem,Its model and algorithm has recently been widely used in many fields.This article mainly explores heuristic solving algorithms for multi-dimensional knapsack problems,by studying relevant literature,elaborating on the advantages and disadvantages of existing algorithms,designing more efficient heuristic solving algorithms for multi-dimensional knapsack problems,and providing new ideas and references for them.
NETL
NSTL
万方数据
