Affirmative action algorithms |
| |
Authors: | Fathi Yahya Tovey Craig |
| |
Affiliation: | (1) Georgia Institute of Technology, School of Industrial and Systems Engineering, 30332 Atlanta, GA, USA |
| |
Abstract: | 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.Research supported by the Georgia Institute of Technology.Research supported by the New Faculty Research Development Program of the Georgia Institute of Technology. Reproduction in whole or in part is permitted for any purpose of the U.S. Government. |
| |
Keywords: | Selection Rules Linear Programming Linear Complementarity Network Flows |
本文献已被 SpringerLink 等数据库收录! |
|