具有有界变量的瓶颈分配问题的一个并行算法(英文)

A PARALLEL ALGORITHM FOR THE BOTTLENECK ALLOCATION PROBLEM WITH BOUNDED VARIABLES

本文提出一并行算法求解具有优个约束以及n个非负有界变量的瓶颈资源分配问题,若有m台处理机,在一定条件下该并行算法的复杂度为O(n(n+logm))。

We develop a parallel algorithm for the bottleneck allocation problem that has m onstraints and n nonnegetive integer bounded variables.Under some assumptions the complexity of he algorithm is O(n(n+logm)) provided m processors are available.