{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:26:09Z","timestamp":1787757969010,"version":"build-2784847793"},"reference-count":94,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf02096264","type":"journal-article","created":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T18:23:22Z","timestamp":1126549402000},"page":"203-233","source":"Crossref","is-referenced-by-count":119,"title":["Pivot rules for linear programming: A survey on recent theoretical developments"],"prefix":"10.1007","volume":"46-47","author":[{"given":"Tam\u00e1s","family":"Terlaky","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02096264_CR1","volume-title":"A monotonic build-up simplex algorithm, Report 91-82. Faculty of Technical Mathematics and Informatics","author":"K.M. Anstreicher","year":"1990","unstructured":"K.M. Anstreicher and T. Terlaky, A monotonic build-up simplex algorithm, Report 91-82. Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands (1990), to appear in Oper. Res."},{"key":"BF02096264_CR2","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/4221.4222","volume":"32","author":"I. Adler","year":"1985","unstructured":"I. Adler and N. Megiddo, A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension, J. ACM 32(1985)891\u2013895.","journal-title":"J. ACM"},{"key":"BF02096264_CR3","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, Notes on Bland's rule, Math. Progr. Study 8(1978)24\u201334.","journal-title":"Math. Progr. Study"},{"key":"BF02096264_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D. Avis","year":"1992","unstructured":"D. Avis and K. Fukuda, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discr. Comp. Geom. 8(1992)295\u2013313.","journal-title":"Discr. Comp. Geom."},{"key":"BF02096264_CR5","doi-asserted-by":"crossref","DOI":"10.21236\/ADA453079","volume-title":"Implementing the simplex method: The initial basis, Report TR90-32","author":"R.E. Bixby","year":"1991","unstructured":"R.E. Bixby, Implementing the simplex method: The initial basis, Report TR90-32, Department of Mathematical Sciences, Rice University, TX, USA (1991)."},{"key":"BF02096264_CR6","volume-title":"The simplex method: It keeps getting better, Lecture at the14th Int. Symp. on Mathematical Programming","author":"R.E. Bixby","year":"1991","unstructured":"R.E. Bixby, The simplex method: It keeps getting better, Lecture at the14th Int. Symp. on Mathematical Programming, Amsterdam, The Netherlands (1991)."},{"key":"BF02096264_CR7","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1287\/opre.40.5.885","volume":"40","author":"R.E. Bixby","year":"1992","unstructured":"R.E. Bixby, J.W. Gregory, I.J. Lustig, R.E. Marsten and D.F. Shanno, Very large-scale linear programming: A case study in combining interior point and simplex methods, Oper. Res. 40(1992)885\u2013897.","journal-title":"Oper. Res."},{"key":"BF02096264_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"R.G. Bland, New finite pivoting rules for the simplex method, Math. Oper. Res. 2(1977)103\u2013107.","journal-title":"Math. Oper. Res."},{"key":"BF02096264_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0095-8956(77)90055-7","volume":"23","author":"R.G. Bland","year":"1977","unstructured":"R.G. Bland, A combinatorial abstraction of linear programming. J. Combin. Theory (Ser. B) 23(1977)33\u201357.","journal-title":"J. Combin. Theory (Ser. B)"},{"key":"BF02096264_CR10","doi-asserted-by":"crossref","unstructured":"K.H. Borgwardt,The Simplex Method: A Probabilistic Analysis, Algorithms and Combinatorics, Vol. 1 (Springer, 1987).","DOI":"10.1007\/978-3-642-61578-8_1"},{"key":"BF02096264_CR11","volume-title":"Resolving degeneracy in combinatorial linear programes: Steepest edge, steepest ascent and closest ascent, Report","author":"E.A. Boyd","year":"1992","unstructured":"E.A. Boyd, Resolving degeneracy in combinatorial linear programes: Steepest edge, steepest ascent and closest ascent, Report, Department of Mathematical Sciences, Rice University, TX, USA (1992)."},{"key":"BF02096264_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1017\/S1446788700039513","volume":"43","author":"N. Cameron","year":"1987","unstructured":"N. Cameron, Stationarity in the simplex method. J. Austral. Math. Soc. 43(1987)137\u2013142.","journal-title":"J. Austral. Math. Soc."},{"key":"BF02096264_CR13","series-title":"Technical Report","volume-title":"Least index resolution of degeneracy in linear complementarity problems","author":"Y.Y. Chang","year":"1979","unstructured":"Y.Y. Chang, Least index resolution of degeneracy in linear complementarity problems, Technical Report 79-14, Department of Operations Research, Stanford University, Stanford, CA, USA (1979)."},{"key":"BF02096264_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01588308","volume":"18","author":"Y.Y. Chang","year":"1980","unstructured":"Y.Y. Chang and R.W. Cottle, Least index resolution of degeneracy in quadratic programming, Math. Progr. 18(1980)127\u2013137.","journal-title":"Math. Progr."},{"key":"BF02096264_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0166-218X(89)90002-4","volume":"25","author":"S.Y. Chang","year":"1989","unstructured":"S.Y. Chang and K.G. Murty, The steepest descent gravitational method for linear programming, Discr. Appl. Math. 25(1989)211\u2013239.","journal-title":"Discr. Appl. Math."},{"key":"BF02096264_CR16","volume-title":"Simplex method and Karmarkar's algorithm: A unifying structure","author":"S.S. Chiu","year":"1985","unstructured":"S.S. Chiu and Y. Ye, Simplex method and Karmarkar's algorithm: A unifying structure, Technical Report, Engineering Economic Systems Department, Stanford University, Stanford, CA, USA (1985)."},{"key":"BF02096264_CR17","first-page":"187","volume":"49","author":"M. Cirina","year":"1985","unstructured":"M. Cirina, Remarks on a recent simplex pivoting rule, Math. Oper. Res. 49(1985)187\u2013199.","journal-title":"Math. Oper. Res."},{"key":"BF02096264_CR18","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/0377-2217(87)90251-7","volume":"29","author":"J. Clausen","year":"1987","unstructured":"J. Clausen, A note on Edmonds-Fukuda's pivoting rule for the simplex method, Eur. J. Oper. Res. 29(1987)378\u2013383.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02096264_CR19","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01582264","volume":"48","author":"R.W. Cottle","year":"1990","unstructured":"R.W. Cottle, The principal pivoting method revisited, Math. Progr. Ser. B, 48(1990)369\u2013385.","journal-title":"Math. Progr. Ser. B"},{"key":"BF02096264_CR20","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":"BF02096264_CR21","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1111\/j.1467-9574.1985.tb01152.x","volume":"39","author":"H.A. Eiselt","year":"1985","unstructured":"H.A. Eiselt and C.-L. Sandblom, External pivoting in the simplex algorithm, Statistica Neerlandica 39(1985)327\u2013341.","journal-title":"Statistica Neerlandica"},{"key":"BF02096264_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0095-8956(78)90039-4","volume":"25","author":"J. Folkman","year":"1978","unstructured":"J. Folkman and J. Lawrence, Oriented matroids, J. Combin. Theory (Ser. B) 25(1978)199\u2013236.","journal-title":"J. Combin. Theory (Ser. B)"},{"key":"BF02096264_CR23","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1147\/sj.311.0011","volume":"31","author":"J.J.H. Forrest","year":"1992","unstructured":"J.J.H. Forrest and J.A. Tomlin, Implementing the simplex method for the optimization subroutine library, IBM Sys. J. 31(1992)11\u201325.","journal-title":"IBM Sys. J."},{"key":"BF02096264_CR24","volume-title":"Oriented matroid programming","author":"K. Fukuda","year":"1982","unstructured":"K. Fukuda, Oriented matroid programming, Ph.D. Thesis, Waterloo University, Waterloo, Ontario, Canada (1982)."},{"key":"BF02096264_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0377-2217(91)90343-T","volume":"52","author":"K. Fukuda","year":"1991","unstructured":"K. Fukuda and T. Matsui, On the finiteness of the criss-cross method, Eur. J. Oper. Res. 52(1991)119\u2013124.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02096264_CR26","series-title":"Research Report","volume-title":"Two extremal behaviors of the criss-cross method for linear complementarity problems","author":"K. Fukuda","year":"1991","unstructured":"K. Fukuda and M. Namiki, Two extremal behaviors of the criss-cross method for linear complementarity problems, Research Report B-241, Department of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan (1991)."},{"key":"BF02096264_CR27","volume-title":"A general algorithmic framework for quadratic programming and a generalization of Edmonds-Fukuda's rule as a finite version of the Van de Panne-Whinston method","author":"K. Fukuda","year":"1989","unstructured":"K. Fukuda and T. Terlaky, A general algorithmic framework for quadratic programming and a generalization of Edmonds-Fukuda's rule as a finite version of the Van de Panne-Whinston method, Preprint, E\u00f6tv\u00f6s University, Budapest (1989)."},{"key":"BF02096264_CR28","first-page":"45","volume":"35","author":"K. Fukuda","year":"1992","unstructured":"K. Fukuda and T. Terlaky, Linear complementarity and oriented matroids, J. Oper. Res. Soc. Japan 35(1992)45\u201361.","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"BF02096264_CR29","volume-title":"Degeneracy graphs \u2014 Theory and application: A state-of-the-art survey, Report No. 142","author":"T. Gal","year":"1989","unstructured":"T. Gal, Degeneracy graphs \u2014 Theory and application: A state-of-the-art survey, Report No. 142, Fern Universit\u00e4t Hagen, Germany (1989)."},{"key":"BF02096264_CR30","volume-title":"The use of the TNP-rule to solve various degeneracy problems, Report No. 149a","author":"T. Gal","year":"1990","unstructured":"T. Gal and F. Geue, The use of the TNP-rule to solve various degeneracy problems, Report No. 149a, Fern Universit\u00e4t Hagen, Germany (1990)."},{"key":"BF02096264_CR31","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/nav.3800020106","volume":"2","author":"S. Gass","year":"1955","unstructured":"S. Gass and Th. Saaty, The computational algorithm for the parametric objective function, Naval Res. Log. Quarterly 2(1955)39\u201345.","journal-title":"Naval Res. Log. Quarterly"},{"key":"BF02096264_CR32","volume-title":"Eine neue Pivotauswahlregel und die durch sie induzierten Teilgraphen des positiven Entartungsgraphen, Report No. 141","author":"F. Geue","year":"1989","unstructured":"F. Geue, Eine neue Pivotauswahlregel und die durch sie induzierten Teilgraphen des positiven Entartungsgraphen, Report No. 141, Fern Universit\u00e4t Hagen, Germany (1989)."},{"key":"BF02096264_CR33","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF01589114","volume":"45","author":"P.E. Gill","year":"1989","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, A practical anti-cycling procedure for linearly constrained optimization, Math. Progr. 45(1989)437\u2013474.","journal-title":"Math. Progr."},{"key":"BF02096264_CR34","volume-title":"Worst case complexity of the shadow vertex simplex algorithm, Report","author":"D. Goldfarb","year":"1983","unstructured":"D. Goldfarb, Worst case complexity of the shadow vertex simplex algorithm, Report, Department of Industrial Engineering and Operations Research, Columbia University, New York, USA (1983)."},{"key":"BF02096264_CR35","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01581089","volume":"57","author":"D. Goldfarb","year":"1992","unstructured":"D. Goldfarb and J.J.H. Forrest, Steepest edge simplex algorithm for linear programming, Math. Progr. 57(1992)341\u2013374.","journal-title":"Math. Progr."},{"key":"BF02096264_CR36","volume-title":"The simplex method is very good! \u2014 On the expected number of pivot steps and related properties of random linear programs, Report","author":"M. Haimovitz","year":"1983","unstructured":"M. Haimovitz, The simplex method is very good! \u2014 On the expected number of pivot steps and related properties of random linear programs, Report, Columbia University, New York, USA (1983)."},{"key":"BF02096264_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"P.M.J. Harris","year":"1973","unstructured":"P.M.J. Harris, Pivot selection methods for the Devex LP code, Math. Progr. 5(1973)1\u201328.","journal-title":"Math. Progr."},{"key":"BF02096264_CR38","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01589398","volume":"42","author":"B. Hattersly","year":"1988","unstructured":"B. Hattersly and J. Wilson, A dual approach to primal degeneracy, Math. Progr. 42(1988)135\u2013176.","journal-title":"Math. Progr."},{"key":"BF02096264_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0024-3795(93)90124-7","volume":"187","author":"D. den Hertog","year":"1993","unstructured":"D. den Hertog, C. Roos and T. Terlaky, The linear complementarity problem, sufficient matrices and the criss-cross method, Lin. Alg. Appl. 187(1993)1\u201314.","journal-title":"Lin. Alg. Appl."},{"key":"BF02096264_CR40","volume-title":"The inverse barrier method for linear programming, Report No. 91-27","author":"D. den Hertog","year":"1991","unstructured":"D. den Hertog, C. Roos and T. Terlaky, The inverse barrier method for linear programming, Report No. 91-27, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands (1991)."},{"key":"BF02096264_CR41","volume-title":"Coloring and duality: Combinatorial augmentation methods","author":"D. Jensen","year":"1985","unstructured":"D. Jensen, Coloring and duality: Combinatorial augmentation methods, Ph.D. Thesis, School of OR and IE, Cornell University, Ithaca, NY, USA (1985)."},{"key":"BF02096264_CR42","series-title":"Technical Report","volume-title":"Machine inspired enhancements of the simplex algorithm","author":"J.E. Kalan","year":"1976","unstructured":"J.E. Kalan, Machine inspired enhancements of the simplex algorithm, Technical Report CS75001-R, Computer Science Department, Virginia Polytechnical University, Blacksburg, VA, USA (1976)."},{"key":"BF02096264_CR43","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4(1984)373\u2013395.","journal-title":"Combinatorica"},{"key":"BF02096264_CR44","first-page":"51","volume":"20","author":"L.G. Khachian","year":"1980","unstructured":"L.G. Khachian, Polynomial algorithms in linear programming, Zhurnal Vichislitelnoj Matematiki i Matematischeskoi Fiziki 20(1980)51\u201368 [in Russian transl: USSR Comp. Math. Math. Phys. 20(1980)53\u201372.","journal-title":"Zhurnal Vichislitelnoj Matematiki i Matematischeskoi Fiziki"},{"key":"BF02096264_CR45","first-page":"155","volume":"7","author":"E. Klafszky","year":"1987","unstructured":"E. Klafszky and T. Terlaky, Remarks on the feasibility problems of oriented matroids, Ann. Univ. Sci. Budapestiensis de Rolando E\u00f6tv\u00f6s Nominatae, Sectio Computatorica, 7(1987)155\u2013157.","journal-title":"Ann. Univ. Sci. Budapestiensis de Rolando E\u00f6tv\u00f6s Nominatae, Sectio Computatorica"},{"key":"BF02096264_CR46","first-page":"79","volume":"20","author":"E. Klafszky","year":"1989","unstructured":"E. Klafszky and T. Terlaky, Variants of the Hungarian method for solving linear programming problems. Math. Oper. und Stat., ser. Optimization 20(1989)79\u201391.","journal-title":"Math. Oper. und Stat., ser. Optimization"},{"key":"BF02096264_CR47","first-page":"127","volume":"24","author":"E. Klafszky","year":"1992","unstructured":"E. Klafszky and T. Terlaky, Some generalizations of the criss-cross method for quadratic programming. Math. Oper. und Stat., ser. Optimization 24(1992)127\u2013139.","journal-title":"Math. Oper. und Stat., ser. Optimization"},{"key":"BF02096264_CR48","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02124679","volume":"9","author":"E. Klafszky","year":"1989","unstructured":"E. Klafszky and T. Terlaky, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, Combinatorica 9(1989)189\u2013198.","journal-title":"Combinatorica"},{"key":"BF02096264_CR49","first-page":"159","volume-title":"Inequalities \u2014 III","author":"E. Klee","year":"1972","unstructured":"E. Klee and G.J. Minty, How good is the simplex algorithm? in:Inequalities \u2014 III, ed. O. Shisha (Academic Press, New York, 1972) pp. 159\u2013175."},{"key":"BF02096264_CR50","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1287\/moor.12.4.718","volume":"12","author":"V. Klee","year":"1987","unstructured":"V. Klee and P. Kleinshcmidt, Thed-step conjecture and its relatives, Math. Oper. Res. 12(1987)718\u2013755.","journal-title":"Math. Oper. Res."},{"key":"BF02096264_CR51","series-title":"Technical Report SOL.","doi-asserted-by":"crossref","DOI":"10.21236\/ADA198945","volume-title":"Dynamic pricing criteria in linear programming","author":"E. Klotz","year":"1988","unstructured":"E. Klotz, Dynamic pricing criteria in linear programming, Technical Report SOL. No. 88-15, Systems Optimization Laboratory, Stanford University, Stanford, CA, USA (1988)."},{"key":"BF02096264_CR52","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1002\/1520-6750(198808)35:4<571::AID-NAV3220350410>3.0.CO;2-L","volume":"35","author":"K.O. Kortanek","year":"1988","unstructured":"K.O. Kortanek and J. Zhu, New purification algorithms for linear programming, Naval Res. Log. Quarterly 35(1988)571\u2013583.","journal-title":"Naval Res. Log. Quarterly"},{"key":"BF02096264_CR53","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/BF01436077","volume":"7","author":"H.P. K\u00fcnzi","year":"1965","unstructured":"H.P. K\u00fcnzi and H. Tzschach, The duoplex-algorithm, Numer. Mathematik 7(1965)222\u2013225.","journal-title":"Numer. Mathematik"},{"key":"BF02096264_CR54","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"C.E. Lemke","year":"1965","unstructured":"C.E. Lemke, Bimatrix equilibrium points and mathematical programming, Manag. Sci. 11(1965)681\u2013689.","journal-title":"Manag. Sci."},{"key":"BF02096264_CR55","series-title":"Technical Report SOL","volume-title":"The equivalence of Dantzig's self-dual parametric algorithm for linear programs to Lemke's algorithm for linear complementarity problems applied to linear programming","author":"I. Lustig","year":"1987","unstructured":"I. Lustig, The equivalence of Dantzig's self-dual parametric algorithm for linear programs to Lemke's algorithm for linear complementarity problems applied to linear programming, Technical Report SOL 87-4, Department of Operations Research, Stanford University, Stanford, CA, USA (1987)."},{"key":"BF02096264_CR56","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01580770","volume":"41","author":"T.L. Magnanti","year":"1988","unstructured":"T.L. Magnanti and J.B. Orlin, Parametric linear programming and anti-cycling pivoting rules, Math. Progr. 41(1988)317\u2013325.","journal-title":"Math. Progr."},{"key":"BF02096264_CR57","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.3.1.63","volume":"3","author":"N. Megiddo","year":"1991","unstructured":"N. Megiddo, On finding primal- and dual-optimal bases, ORSA J. Comp. 3(1991)63\u201365.","journal-title":"ORSA J. Comp."},{"key":"BF02096264_CR58","volume-title":"Switching from a primal-dual Newton algorithm to a primal-dual (interior) simplex-algorithm, RJ 6327 (61996)","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, Switching from a primal-dual Newton algorithm to a primal-dual (interior) simplex-algorithm, RJ 6327 (61996), IBM Almaden Research Center, San Jose, CA, USA (1988)."},{"key":"BF02096264_CR59","first-page":"123","volume":"11","author":"K.G. Murty","year":"1974","unstructured":"K.G. Murty, A note on a Bard type scheme for solving the complementarity problem, Opsearch 11(1974)123\u2013130.","journal-title":"Opsearch"},{"key":"BF02096264_CR60","volume-title":"Linear and Combinatorial Programming","author":"K.G. Murty","year":"1976","unstructured":"K.G. Murty,Linear and Combinatorial Programming (Krieger, Malabar, USA, 1976)."},{"key":"BF02096264_CR61","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01581642","volume":"19","author":"K.G. Murty","year":"1980","unstructured":"K.G. Murty, Computational complexity of parametric linear programming, Math. Progr. 19(1980)213\u2013219.","journal-title":"Math. Progr."},{"key":"BF02096264_CR62","first-page":"206","volume":"23","author":"K.G. Murty","year":"1986","unstructured":"K.G. Murty, The gravitational method of linear programming, Opsearch 23(1986)206\u2013214.","journal-title":"Opsearch"},{"key":"BF02096264_CR63","series-title":"Sigma Series in Applied Mathematics","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"K.G. Murty","year":"1988","unstructured":"K.G. Murty,Linear Complementarity, Linear and Nonlinear Programming, Sigma Series in Applied Mathematics, Vol. 3 (Heldermann, Berlin, 1988)."},{"key":"BF02096264_CR64","series-title":"Technical Report","volume-title":"A new interior variant of the gradient projection method for linear programming","author":"K.G. Murty","year":"1985","unstructured":"K.G. Murty, A new interior variant of the gradient projection method for linear programming, Technical Report No. 85-18, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109-2117, USA (1985)."},{"key":"BF02096264_CR65","volume-title":"Some modifications of the criss-cross method, Research Report, Department of Information Sciences","author":"M. Namiki","year":"1990","unstructured":"M. Namiki and T. Matsui, Some modifications of the criss-cross method, Research Report, Department of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan (1990)."},{"key":"BF02096264_CR66","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01721801","volume":"12","author":"P.-Q. Pan","year":"1988","unstructured":"P.-Q. Pan, Practical finite pivoting rules for the simplex method, OR Spektrum 12(1988)219\u2013225.","journal-title":"OR Spektrum"},{"key":"BF02096264_CR67","first-page":"77","volume":"26","author":"K. Paparrizos","year":"1989","unstructured":"K. Paparrizos, Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples, Opsearch 26(1989)77\u201395.","journal-title":"Opsearch"},{"key":"BF02096264_CR68","unstructured":"K. Paparrizos, An exterior point simplex algorithm. Lecture at theEURO-TIMS Conf., Belgrade, Jugoslavia (1989)."},{"key":"BF02096264_CR69","unstructured":"K. Paparrizos, A simplex algorithm with a new monotonicity property, Working Paper (1991)."},{"key":"BF02096264_CR70","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01586925","volume":"51","author":"K. Paparrizos","year":"1991","unstructured":"K. Paparrizos, An infeasible (exterior point) simplex algorithm for assignment problems, Math. Progr. 51(1991)45\u201354.","journal-title":"Math. Progr."},{"key":"BF02096264_CR71","volume-title":"A pivoting rule for the simplex method which is related to Karmarkar's potential function, Manuscript, Faculty of Technical Mathematics and Informatics","author":"C. Roos","year":"1986","unstructured":"C. Roos, A pivoting rule for the simplex method which is related to Karmarkar's potential function, Manuscript, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands (1986)."},{"key":"BF02096264_CR72","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BF01585729","volume":"46","author":"C. Roos","year":"1990","unstructured":"C. Roos, An exponential example for Terlaky's pivoting rule for the criss-cross simplex method, Math. Progr. 46(1990)78\u201394.","journal-title":"Math. Progr."},{"key":"BF02096264_CR73","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01580776","volume":"41","author":"D.M. Ryan","year":"1988","unstructured":"D.M. Ryan and M.R. Osborne, On the solution of highly degenerate linear programmes, Math. Progr. 41(1988)385\u2013392.","journal-title":"Math. Progr."},{"key":"BF02096264_CR74","unstructured":"A. Schrijver,Theory of Linear and Integer Programming (J. Wiley, 1987)."},{"key":"BF02096264_CR75","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF02592222","volume":"29","author":"A. Sehti","year":"1984","unstructured":"A. Sehti and G. Thompson, The pivot-and-probe algorithm for solving a linear problem, Math. Progr. 29(1984)219\u2013233.","journal-title":"Math. Progr."},{"key":"BF02096264_CR76","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1137\/1033049","volume":"33","author":"R.E. Stone","year":"1991","unstructured":"R.E. Stone and C.A. Tovey, The simplex and projective scaling algorithms as iteratively reweighted least squares methods, SIAM Rev. 33(1991)220\u2013237.","journal-title":"SIAM Rev."},{"key":"BF02096264_CR77","unstructured":"A. Tamura, private communication (1991)."},{"key":"BF02096264_CR78","first-page":"413","volume":"31","author":"A. Tamura","year":"1988","unstructured":"A. Tamura, H. Takehara, K. Fukuda, S. Fujishige and M. Kojima, A dual interior primal simplex method for linear programming. J. Oper. Res. Soc. Japan 31(1988)413\u2013430.","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"BF02096264_CR79","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0095-8956(87)90049-9","volume":"42","author":"T. Terlaky","year":"1987","unstructured":"T. Terlaky, A finite criss-cross method for oriented matroids, J. Combin. Theory (Ser. B) 42(1987)319\u2013327.","journal-title":"J. Combin. Theory (Ser. B)"},{"key":"BF02096264_CR80","first-page":"683","volume":"16","author":"T. Terlaky","year":"1985","unstructured":"T. Terlaky, A convergent criss-cross method, Math. Oper. und Stat., ser. Optimization 16(1985)683\u2013690.","journal-title":"Math. Oper. und Stat., ser. Optimization"},{"key":"BF02096264_CR81","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/S0377-2217(87)80152-2","volume":"32","author":"T. Terlaky","year":"1987","unstructured":"T. Terlaky, A new algorithm for quadratic programming, Eur. J. Oper. Res. 32(1987)294\u2013301.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02096264_CR82","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0605046","volume":"5","author":"M.J. Todd","year":"1984","unstructured":"M.J. Todd, Complementarity in oriented matroids, SIAM J. Alg. Discr. Math. 5(1984)467\u2013485.","journal-title":"SIAM J. Alg. Discr. Math."},{"key":"BF02096264_CR83","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0095-8956(85)90042-5","volume":"39","author":"M.J. Todd","year":"1985","unstructured":"M.J. Todd, Linear and quadratic programming in oriented matroids, J. Combin. Theory (Ser. B) 39(1985)105\u2013133.","journal-title":"J. Combin. Theory (Ser. B)"},{"key":"BF02096264_CR84","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1287\/opre.38.6.1006","volume":"38","author":"M.J. Todd","year":"1990","unstructured":"M.J. Todd, A. Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm, Oper. Res. 38(1990)1006\u20131018.","journal-title":"Oper. Res."},{"key":"BF02096264_CR85","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01580646","volume":"35","author":"M.J. Todd","year":"1986","unstructured":"M.J. Todd, Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems, Math. Progr. 35(1986)173\u2013192.","journal-title":"Math. Progr."},{"key":"BF02096264_CR86","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1287\/moor.2.2.143","volume":"2","author":"A. Tucker","year":"1977","unstructured":"A. Tucker, A note on convergence of the Ford-Fulkerson flow algorithm, Math. Oper. Res. 2(1977)143\u2013144.","journal-title":"Math. Oper. Res."},{"key":"BF02096264_CR87","unstructured":"Zh. Wang, A conformal elimination-free algorithm for oriented matroid programming, Chin. Ann. Math. 8(B1)(1987)."},{"key":"BF02096264_CR88","unstructured":"Zh. Wang, A modified version of the Edmonds-Fukuda algorithm for LP problems in the general form, Asia-Pacific J. Oper. Res. (1989)."},{"key":"BF02096264_CR89","unstructured":"Zh. Wang, A general deterministic pivot method for oriented matroid programming, Chin. Ann. Math. (1990)."},{"key":"BF02096264_CR90","unstructured":"Y. Ye and J.A. Kaliski, Further results on build-up approaches for linear programming, Lecture at theORSA\/TIMS Meeting, Anaheim, CA, USA (1991)."},{"key":"BF02096264_CR91","series-title":"Technical Report","volume-title":"What is the worst case behavior of the simplex algorithm?","author":"N. Zadeh","year":"1980","unstructured":"N. Zadeh, What is the worst case behavior of the simplex algorithm?, Technical Report No. 27, Department of Operations Research, Stanford University, Stanford, CA, USA (1980)."},{"key":"BF02096264_CR92","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0167-6377(91)90058-W","volume":"10","author":"S. Zhang","year":"1991","unstructured":"S. Zhang, On anti-cycling pivoting rules for the simplex method, Oper. Res. Lett. 10(1991)189\u2013192.","journal-title":"Oper. Res. Lett."},{"key":"BF02096264_CR93","series-title":"Technical Report","volume-title":"Linear programming in oriented matroids","author":"G.M. Ziegler","year":"1990","unstructured":"G.M. Ziegler, Linear programming in oriented matroids, Technical Report No. 195, Institut f\u00fcr Mathematik, Universit\u00e4t Augsburg, Germany (1990)."},{"key":"BF02096264_CR94","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1287\/mnsc.15.7.426","volume":"15","author":"S. Zionts","year":"1969","unstructured":"S. Zionts, The criss-cross method for solving linear programming problems, Manag. Sci. 15(1969)426\u2013445.","journal-title":"Manag. Sci."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096264.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02096264\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096264.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T00:15:31Z","timestamp":1652487331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02096264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":94,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF02096264"],"URL":"https:\/\/doi.org\/10.1007\/bf02096264","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}