Affirmative action algorithms
DOI10.1007/BF01582232zbMath0594.90053OpenAlexW2018756466MaRDI QIDQ3725860
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582232
linear complementaritysimplex methodcomputational resultsnetwork flowselection ruleAffirmative actionaugmenting path methodsBard-type schemes
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Deterministic network models in operations research (90B10)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple heuristic approach to simplex efficiency
- A decision rule in the simplex method that avoids cycling
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- On the length of simplex paths: The assignment case
- On the simplex algorithm for networks and generalized networks
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Computational complexity of complementary pivot methods
- New Finite Pivoting Rules for the Simplex Method
- Theoretical Properties of the Network Simplex Method
- More pathological examples for network flow problems
- Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
This page was built for publication: Affirmative action algorithms