搜索结果: 1-1 共查到“应用数学 Unbounded knapsack problem”相关记录1条 . 查询时间(0.075 秒)
Two Topics in Dominance Relations for the Unbounded Knapsack Problem
Combinatorial optimisation Unbounded knapsack problem Dominance relation Polynomially solvable special case
2008/11/10
On the unbounded knapsack problem, dominance relations play a crucial role to reduce items to be considered in a given instance. This article picks up two topics in dominance relations. One is a conne...