Affirmative action algorithms

DOI10.1007/BF01582232MaRDI QIDQ3725860zbMATH OpenOpenAlexFDO

Authors Yahya Fathi, Craig A. Tovey

Publication date 1986

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01582232

zbMATH Keywords

Affirmative actionaugmenting path methodsBard-type schemescomputational resultslinear complementaritynetwork flowselection rulesimplex method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming involving graphs or networks (90C35)

Recommendations

• Affirmative action and school choice
• Effective affirmative action in school choice
• Affirmative action in school choice: a new solution
• Affirmative actions: the Boston mechanism case
• Object allocation via immediate-acceptance: characterizations and an affirmative action application

Cites work

• A decision rule in the simplex method that avoids cycling
• A simple heuristic approach to simplex efficiency
• Combinatorial optimization. Networks and matroids
• Computational complexity of complementary pivot methods
• Computational complexity of LCPs associated with positive definite symmetric matrices
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3825556 (Why is no real title available?)
• scientific article; zbMATH DE number 3726093 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 3626518 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3354790 (Why is no real title available?)
• scientific article; zbMATH DE number 3363343 (Why is no real title available?)
• More pathological examples for network flow problems
• New Finite Pivoting Rules for the Simplex Method
• On the length of simplex paths: The assignment case
• On the simplex algorithm for networks and generalized networks
• The simplex algorithm with the pivot rule of maximizing criterion improvement
• Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Theoretical Properties of the Network Simplex Method
• What is the worst case behavior of the simplex algorithm?

Cited in

(3)

• A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
• Algorithms as discrimination detectors
• On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes

This page was built for publication: Affirmative action algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3725860)