Abstract: In this paper, we propose to solve the max-min multiple knapsack problem by using an exact solution search. An instance of the problem is defined by a set of n items to be packed into m ...
一些您可能无法访问的结果已被隐去。
显示无法访问的结果一些您可能无法访问的结果已被隐去。
显示无法访问的结果