Affirmative action algorithms
Affirmative action algorithms
复制标题
平权行动算法
作者：
Y. Fathi;C. Tovey
肯定性行动是一种新的选择规则，它利用历史信息来选择过去没有被选择过的元素。我们将这一原则的三种实现方式进行分类，并讨论其应用单纯形法，巴德型计划的线性互补问题，并增加网络流问题的路径方法。我们目前的分析和计算结果，以及一些悬而未决的问题。
Affirmative action is a new variety of selection rule which employs historical information to favor the choice of elements that have not been selected in the past. We categorize three implementations of this principle and discuss their application to the simplex method, to Bard-type schemes for the linear complementarity problem, and to augmenting path methods for network flow problems. We present analytical and computational results, and some open questions.