{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T12:36:56Z","timestamp":1692448616001},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1986,4]]},"DOI":"10.1007\/bf01582232","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:32:13Z","timestamp":1114677133000},"page":"292-301","source":"Crossref","is-referenced-by-count":3,"title":["Affirmative action algorithms"],"prefix":"10.1007","volume":"34","author":[{"given":"Yahya","family":"Fathi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Craig","family":"Tovey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BFb0121192","volume":"8","author":"D. Avis","year":"1978","unstructured":"D. Avis and V. Chv\u00e1tal, \u201cNotes on Bland's pivoting rule\u201c,Mathematical Programming Study 8 (1978) 24\u201334.","journal-title":"Mathematical Programming Study"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01386081","volume":"6","author":"A.G. Azpeitia","year":"1964","unstructured":"A.G. Azpeitia and D.J. Dickinson, \u201cA decision rule in the simplex method that avoids cycling\u201c,Numerische Mathematik 6 (1964) 329\u2013331.","journal-title":"Numerische Mathematik"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/B978-0-12-597050-1.50009-9","volume-title":"Nonlinear programming","author":"R.H. Bartels","year":"1970","unstructured":"R.H. Bartels, G.H. Golub and M.A. Saunders, \u201cNumerical techniques in mathematical programming\u201c, in: J.B. Rosen, O.L. Mangasarian, and K. Ritter, eds.,Nonlinear programming (Academic Press, New York, 1970) pp. 123\u2013176."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"R.G. Bland, \u201cNew finite pivoting rules for the simplex method\u201c,Mathematics of Operations Research 2 (1977) 103\u2013107.","journal-title":"Mathematics of Operations Research"},{"key":"CR5","volume-title":"Linear programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal,Linear programming (Freeman and Company, New York, 1983)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.4.2.196","volume":"4","author":"W.H. Cunningham","year":"1979","unstructured":"W.H. Cunningham, \u201cTheoretical properties of the network simplex method\u201c,Mathematics of Operations Research 4 (1979) 196\u2013208.","journal-title":"Mathematics of Operations Research"},{"key":"CR7","volume-title":"\u201cExperiments in linear programming\u201d, Report No. RM-3402","author":"L. Cutler","year":"1963","unstructured":"L. Cutler and P. Wolfe, \u201cExperiments in linear programming\u201d, Report No. RM-3402 (The Rand Corporation, Santa Monica, CA, 1963)."},{"key":"CR8","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R.M. Karp, \u201cTheoretical improvements in algorithmic efficiency for network flow problems\u201c,Journal of the ACM 19 (1972) 248\u2013264.","journal-title":"Journal of the ACM"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF01588254","volume":"17","author":"Y. Fathi","year":"1979","unstructured":"Y. Fathi, \u201cComputational complexity of LCPs associated with positive definite symmetric matrices\u201c,Mathematical Programming 17 (1979) 335\u2013344.","journal-title":"Mathematical Programming"},{"key":"CR11","volume-title":"Flows in networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"L.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, NJ, 1962)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0012-365X(73)90171-4","volume":"4","author":"R.G. Jeroslow","year":"1973","unstructured":"R.G. Jeroslow, \u201cThe simplex algorithm with the pivot rule of maximizing improvement criterion\u201c,Discrete Mathematics 4 (1973) 367\u2013377.","journal-title":"Discrete Mathematics"},{"key":"CR13","first-page":"351","volume":"40","author":"D. Kelly","year":"1981","unstructured":"D. Kelly, \u201cSome results on random linear programs\u201c,Operations Research Verfahren 40 (1981) 351\u2013355.","journal-title":"Operations Research Verfahren"},{"key":"CR14","first-page":"159","volume-title":"Inequalities, III","author":"V. Klee","year":"1972","unstructured":"V. Klee and G.J. Minty, \u201cHow good is the simplex algorithm?\u201c, in: O. Shisa, ed.,Inequalities, III (Academic Press, New York, 1972), pp. 159\u2013175."},{"key":"CR15","volume-title":"Combinatorial optimization: Networks and matroids","author":"E.L. Lawler","year":"1972","unstructured":"E.L. Lawler,Combinatorial optimization: Networks and matroids (Holt, Rinehart and Winston, New York, 1972)."},{"key":"CR16","unstructured":"T.M. Liebling, \u201cNote on a vertex following algorithm with a Poisson distributed number of iterations\u201d, Technical Report, Mathematics Department, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (1981)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02591931","volume":"30","author":"P.O. Lindberg","year":"1984","unstructured":"P.O. Lindberg and S. Olafsson, \u201cOn the length of simplex paths: The assignment case\u201c, to appear inMathematical Programming 30 (1984) 243\u2013260.","journal-title":"Mathematical Programming"},{"key":"CR18","first-page":"123","volume":"11","author":"K.G. Murty","year":"1974","unstructured":"K.G. Murty, \u201cNote on a Bard-Type scheme for solving the complementarity problem\u201c,Opsearch 11 (1974) 123\u2013130.","journal-title":"Opsearch"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120782","volume":"7","author":"K.G. Murty","year":"1978","unstructured":"K.G. Murty, \u201cComputational complexity of complementary pivot methods\u201c,Mathematical Programming Study 7 (1978) 61\u201373.","journal-title":"Mathematical Programming Study"},{"key":"CR20","volume-title":"Linear programming","author":"K.G. Murty","year":"1983","unstructured":"K.G. Murty,Linear programming (Wiley, New York, 1983)."},{"key":"CR21","series-title":"Working Paper","volume-title":"On the simplex algorithm for networks and generalized networks","author":"J.B. Orlin","year":"1983","unstructured":"J.B. Orlin, \u201cOn the simplex algorithm for networks and generalized networks\u201d, Working Paper #1467-83 (Sloan School of Management, MIT, 1983)."},{"key":"CR22","volume-title":"Combinatorial optimization: Algorithms and complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial optimization: Algorithms and complexity (Prentice-Hall, Inc., Englewood Cliffs, N.J., 1982)."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/0377-2217(82)90177-1","volume":"9","author":"S. Ross","year":"1982","unstructured":"S. Ross, \u201cA simple heuristic approach to simplex efficiency\u201c,European Journal of Operational Research 9 (1982) 344\u2013346.","journal-title":"European Journal of Operational Research"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"C.A. Tovey, \u201cLow order polynomial bounds on the expected performance of local improvement algorithms\u201d, to appear inMathematical Programming Study (1985).","DOI":"10.1007\/BF01580647"},{"key":"CR25","unstructured":"L. Watson, private communication (1982)."},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"N. Zadeh, \u201cTheoretical efficiency of the Edmonds-Karp Algorithm for computing maximal flows\u201d,Journal of the ACM (1972) 184\u2013192.","DOI":"10.1145\/321679.321693"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01580122","volume":"5","author":"N. Zadeh","year":"1973","unstructured":"N. Zadeh, \u201cMore pathological examples for network flow problems\u201c,Mathematical Programming 5 (1973) 217\u2013224.","journal-title":"Mathematical Programming"},{"key":"CR28","unstructured":"N. Zadeh, \u201cWhat is the worst case behavior of the simplex algorithm?\u201d, Technical Report 37, May 1980, Department of Operations Research, Stanford University."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582232.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582232\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T02:32:00Z","timestamp":1683081120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["BF01582232"],"URL":"https:\/\/doi.org\/10.1007\/bf01582232","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}