2) Multiple-choice multidimensional knapsack
多选择多维背包
3) multidimensional knapsack model
多维背包模型
1.
The resource constrained scheduling problem is first decomposed into a series ofmultidimensional knapsack models and an equivalent Hopfield network model for this representation is estab-lished.
有约束的资源调度问题首先被分解成一系列多维背包模型并且为背包模型建立了一个等价的Ｈｏｐｆｉｅｌｄ神经网络，然后通过扩展Ｈｏｐｆｉｅｌｄ网络，给出了一种求解有约束的资源调度问题的方法。
4) multidimensional knapsack problem
多维背包问题
1.
Binary ant system for multidimensional knapsack problem
多维背包问题的二进制蚂蚁算法
2.
Recently,some researchers have proposed several different ACO algorithms to solve the multidimensional knapsack problem(MKP),which is an NP-hard combinatorial optimization problem.
近年来,已提出几个ACO算法求解多维背包问题(MKP)。
3.
The multidimensional knapsack problem (MKP) is a classical combinatorial optimization problem, whose goal is to find a subset of objects that maximizes the total profit while satisfying some resource constraints.
针对蚁群算法在求解大规模多维背包问题时存在的迭代次数过多、精度不高的不足,提出一种新的高性能的蚁群求解算法。
5) multidimensional knapsack arithmetic
多维背包算法
1.
A flexible selection structure BS-Serv(bidirectional selection-serv) is de-signed,the provider use the multidimensional knapsack arithmetic,the requestor use the needed wait time principle,to realize the bi-directional selection between the provider and the requestor,thus not only make the most adequately use of the provider s r.
通过设计一个灵活的选择结构BS-Serv(bidirectional selection-serv),提供者使用多维背包算法,请求者使用需要等待时间原则,来实现提供者和请求者的双向选择,从而即保证了提供者的资源能达到最充分的利用,提高了Web服务的QoS,还保证了请求者对服务的满意。
6) Multiple Choice Multi-Dimensional Knapsack problem
多选择多维背包问题
补充资料：背包
行军或外出时背（bēi）在背上的衣被包裹。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条