线性分配问题的全局灵敏度分析
Global Sensitivity Analysis for the Linear Assignment Problem
摘要：
在本文中，解决了以下问题：给定一个线性分配问题，有多少可以所有的个人分配权重扰动而不改变最优分配？扩展的结果涉及扰动在一个边缘或一行/列。这些界限的推导算法。我们还展示了如何使用这些界限，以防止在多车辆的指导方案分配搅拌。
英文摘要：
In this paper, the following question is addressed: given a linear assignment problem, how much can the all of the individual assignment weights be perturbed without changing the optimal assignment? The extension of results involving perturbations in just one edge or one row/column are presented. Algorithms for the derivation of these bounds are provided. We also show how these bounds may be used to prevent assignment churning in a multi-vehicle guidance scenario.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
