The assignment problem: exploring parallelism
The assignment problem: exploring parallelism
复制标题
分配问题：探索并行性
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
T. Rolfe
中科院分区：
文献类型：
--
作者：
T. Rolfe
线性分配问题需要确定将任务分配给代理的最佳排列向量。甚至回溯实现也支持相当强大的边界函数。由于排列族的处理（基于低下标向量分配）可以彼此独立地完成，因此可以检查并行处理策略，并发现并行执行是一个非常糟糕的主意的实例。由于文章篇幅限制，本文仅讨论并行回溯。后面的文章将并行讨论分支定界。
The linear assignment problem requires the determination of an optimal permutation vector for the assignment of tasks to agents. Even the backtracking implementation supports a rather powerful bounding function. Since the processing of permutation families (based on low-subscripted vector assignments) can be done independently of each other, one may examine parallel processing strategies, and discovery of instances in which the parallel execution is a very bad idea. Because of article size limitations, this article discusses only backtracking in parallel. A later article will address branch-and-bound in parallel.