{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:10:04Z","timestamp":1640171404701},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":[[1997,10]]},"DOI":"10.1007\/bf02614325","type":"journal-article","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T00:34:10Z","timestamp":1177720450000},"page":"369-395","source":"Crossref","is-referenced-by-count":17,"title":["Criss-cross methods: A fresh view on pivot algorithms"],"prefix":"10.1007","volume":"79","author":[{"given":"Komei","family":"Fukuda","sequence":"first","affiliation":[]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02614325_CR1","doi-asserted-by":"crossref","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,Journal of the Association of Computing Machinery 32 (1985) 891\u2013895.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"BF02614325_CR2","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\u2019s rule,Mathematical Programming Study 8 (1978) 24\u201334.","journal-title":"Mathematical Programming Study"},{"key":"BF02614325_CR3","doi-asserted-by":"crossref","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,Discrete and Computational Geometry 8 (1992) 295\u2013313.","journal-title":"Discrete and Computational Geometry"},{"key":"BF02614325_CR4","volume-title":"Advances in Linear and Integer Programming","year":"1996","unstructured":"J. Beasley, ed.,Advances in Linear and Integer Programming (Oxford University Press, Oxford, UK, 1996)."},{"key":"BF02614325_CR5","unstructured":"R.E. Bixby, The simplex method: It keeps getting better, Lecture at the 14th International Symposium on Mathematical Programming, Amsterdam, The Netherlands, 1991."},{"key":"BF02614325_CR6","volume-title":"Oriented Matroids","author":"A. Bj\u00f6rner","year":"1993","unstructured":"A. Bj\u00f6rner, M. Las Vergnas, B. Sturmfels, N. White and G. Ziegler,Oriented Matroids (Cambridge University Press, Cambridge, MA, 1993)."},{"key":"BF02614325_CR7","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, New finite pivoting rules for the simplex method,Mathematics of Operations Research 2 (1977) 103\u2013107.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614325_CR8","doi-asserted-by":"crossref","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,Journal of Combinatorial Theory, Series B 23 (1977) 33\u201357.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02614325_CR9","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(78)90080-1","volume":"24","author":"R.G. Bland","year":"1978","unstructured":"R.G. Bland and M. Las Vergnas, Orientability of matroids,Journal of Combinatorial Theory, Series B 24 (1978) 94\u2013123.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02614325_CR10","volume-title":"Algorithms and Combinatorics","author":"K.H. Borgwardt","year":"1987","unstructured":"K.H. Borgwardt,The Simplex Method: A Probabilistic Analysis, Algorithms and Combinatorics, Vol. 1 (Springer, Berlin, 1987)."},{"key":"BF02614325_CR11","unstructured":"K. Cameron and J. Edmonds, Existentially polytime theorems, in:Proceedings of the DIMACS Workshop in Polyhedral Combinatorics, 1993."},{"key":"BF02614325_CR12","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, 1979."},{"key":"BF02614325_CR13","doi-asserted-by":"crossref","first-page":"160","DOI":"10.2307\/1907845","volume":"20","author":"A. Charnes","year":"1952","unstructured":"A. Charnes, Optimality and degeneracy in linear programming,Econometrica 20 (1952) 160\u2013170.","journal-title":"Econometrica"},{"key":"BF02614325_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-6377(94)90023-X","volume":"16","author":"H.-D. Chen","year":"1994","unstructured":"H.-D. Chen, P.M. Pardalos and M.A. Saunders, The simplex algorithm with a new primal and dual pivot rule,Operations Research Letters 16 (1994) 121\u2013127.","journal-title":"Operations Research Letters"},{"key":"BF02614325_CR15","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal,Linear Programming (W.H. Freeman and Company, San Francisco, 1983)."},{"key":"BF02614325_CR16","doi-asserted-by":"crossref","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 pivoting rule for the simplex method,European Journal of Operations Research 29 (1987) 378\u2013383.","journal-title":"European Journal of Operations Research"},{"key":"BF02614325_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1090\/qam\/156707","volume":"21","author":"R.W. Cottle","year":"1963","unstructured":"R.W. Cottle, Symmetric dual quadratic programs,Quarterly of Applied Mathematics 21 (1963) 237\u2013243.","journal-title":"Quarterly of Applied Mathematics"},{"key":"BF02614325_CR18","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(68)90052-9","volume":"1","author":"R.W. Cottle","year":"1968","unstructured":"R.W. Cottle and G.B. Dantzig, Complementary pivot theory of mathematical programming,Linear Algebra and Its Applications 1 (1968) 103\u2013125.","journal-title":"Linear Algebra and Its Applications"},{"key":"BF02614325_CR19","first-page":"235","volume":"114\/115","author":"R.W. Cottle","year":"1987","unstructured":"R.W. Cottle, J.-S. Pang and V. Venkateswaran, Sufficient matrices and the linear complementarity problem.Linear Algebra and Its Applications 114\/115 (1987) 235\u2013249.","journal-title":"Linear Algebra and Its Applications"},{"key":"BF02614325_CR20","volume-title":"The Linear Complementarity Problem","author":"R.W. Cottle","year":"1992","unstructured":"R.W. Cottle, J.-S. Pang and R.E. Stone,The Linear Complementarity Problem (Academic Press, New York, 1992)."},{"key":"BF02614325_CR21","unstructured":"G.B. Dantzig, Programming in a linear structure,Comptroller, USAF Washington, DC (February 1948)."},{"key":"BF02614325_CR22","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":"BF02614325_CR23","first-page":"19","volume-title":"History of Mathematical Programming","author":"G.B. Dantzig","year":"1991","unstructured":"G.B. Dantzig, Linear programming: The story about how it began, in: A.H.G. Rinnoy Kan, L.K. Lenstra and A. Schrijver, eds.,History of Mathematical Programming (CWI, North-Holland, Amsterdam, 1991). 19\u201331."},{"key":"BF02614325_CR24","doi-asserted-by":"crossref","first-page":"183","DOI":"10.2140\/pjm.1955.5.183","volume":"5","author":"G.B. Dantzig","year":"1955","unstructured":"G.B. Dantzig, A. Orden and P. Wolfe, The generalized simplex method for minimizing a linear form under linear inequality restraints,Pacific Journal of Mathematics 5 (1955) 183\u2013195.","journal-title":"Pacific Journal of Mathematics"},{"key":"BF02614325_CR25","unstructured":"J. Edmonds, Exact pivoting, Presentation, ECCO VII, 1994."},{"key":"BF02614325_CR26","unstructured":"J. Edmonds, A Helly method for linear programming, presentation, CO94, Amsterdam, 1994."},{"key":"BF02614325_CR27","unstructured":"J. Edmonds and K. Fukuda, NP easy and LP theory, Cours postgrade en Recherche Op\u00e9rationnelle, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, 1994."},{"key":"BF02614325_CR28","doi-asserted-by":"crossref","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,Journal of Combinatorial Theory, Series B 25 (1978) 199\u2013236.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02614325_CR29","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":"BF02614325_CR30","doi-asserted-by":"crossref","unstructured":"K. Fukuda, H.-J. L\u00fcthi and M. Namiki, The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP,ITOR, to appear.","DOI":"10.1111\/j.1475-3995.1997.tb00083.x"},{"key":"BF02614325_CR31","unstructured":"K. Fukuda and H.-J. L\u00fcthi, Combinatorial maximum improvement algorithm for LP and LCP, Presented at Franco-Japanese Days, Brest, France, 1995."},{"key":"BF02614325_CR32","doi-asserted-by":"crossref","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,European Journal of Operations Research 52 (1991) 119\u2013124.","journal-title":"European Journal of Operations Research"},{"key":"BF02614325_CR33","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01582581","volume":"64","author":"K. Fukuda","year":"1994","unstructured":"K. Fukuda and M. Namiki, On extremal behaviors of Murty\u2019s least index method,Mathematical Programming 64 (1994) 365\u2013370.","journal-title":"Mathematical Programming"},{"key":"BF02614325_CR34","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(94)00088-U","volume":"56","author":"K. Fukuda","year":"1995","unstructured":"K. Fukuda and M. Namiki, Finding all common basis in two matroids,Discrete Applied Mathematics 56 (1995) 231\u2013243.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02614325_CR35","unstructured":"K. Fukuda, M. Namiki and A. Tamura, EP theorems and linear complementarity problems, Technical Report, Institute for Operations Research, ETH-Zentrum, CH-8092 Z\u00fcrich, Switzerland, 1996."},{"key":"BF02614325_CR36","doi-asserted-by":"crossref","first-page":"45","DOI":"10.15807\/jorsj.35.45","volume":"35","author":"K. Fukuda","year":"1992","unstructured":"K. Fukuda and T. Terlaky, Linear complementarity and oriented matroids,Journal of the Operational Research Society of Japan 35 (1992) 45\u201361.","journal-title":"Journal of the Operational Research Society of Japan"},{"key":"BF02614325_CR37","unstructured":"D. Goldfarb, Worst case complexity of the shadow vertex simplex algorithm, Technical Report, Department of Industrial Engineering and Operations Research, Columbia University, 1983."},{"key":"BF02614325_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(93)90124-7","volume":"187","author":"D. Hertog Den","year":"1993","unstructured":"D. Den Hertog, C. Roos and T. Terlaky, The linear complementarity problem, sufficient matrices and the criss-cross method,Linear Algebra and Its Applications 187 (1993) 1\u201314.","journal-title":"Linear Algebra and Its Applications"},{"key":"BF02614325_CR39","volume-title":"A finite criss-Cross method for hyperbolic programming","author":"T. Ill\u00e9s","year":"1996","unstructured":"T. Ill\u00e9s. \u00c1. Szirmai and T. Terlaky, A finite criss-Cross method for hyperbolic programming, Report No. 96-103, Faculteit der Technische Wiskunde en Informatica, Technische Universiteit Delft, The Netherlands, 1996; also in:European Journal of Operations Research, to appear."},{"key":"BF02614325_CR40","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, 1985."},{"key":"BF02614325_CR41","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1090\/S0273-0979-1992-00285-9","volume":"26","author":"G. Kalai","year":"1992","unstructured":"G. Kalai and D. Kleitman, A quasi-polynomial bound for the diameter of graphs of polyhedra,Bull. Amer. Math. Soc. 26 (1992) 315\u2013316.","journal-title":"Bull. Amer. Math. Soc."},{"key":"BF02614325_CR42","doi-asserted-by":"crossref","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":"BF02614325_CR43","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); English translation in:USSR Computational Mathematics and Mathematical Physics 20 (1980) 53\u201372.","journal-title":"Zhurnal Vichislitelnoj Matematiki i Matematischeskoi Fiziki"},{"key":"BF02614325_CR44","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":"BF02614325_CR45","doi-asserted-by":"crossref","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":"BF02614325_CR46","first-page":"159","volume-title":"Inequalities - III","author":"V. Klee","year":"1972","unstructured":"V. Klee and G.J. Minty, How good is the simplex algorithm? in: O. Shisha, ed.,Inequalities - III (Academic Press, New York, 1972) 159\u2013175."},{"key":"BF02614325_CR47","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1287\/moor.12.4.718","volume":"12","author":"V. Klee","year":"1987","unstructured":"V. Klee and P. Kleinschmidt, Thed-step conjecture and its relatives,Mathematics of Operations Research 12 (1987) 718\u2013755.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614325_CR48","volume-title":"Lecture Notes in Computer Science","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, T. Noma and A. Yoshise,A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science Vol. 538 (Springer, Berlin, 1991)."},{"key":"BF02614325_CR49","first-page":"413","volume":"12","author":"C.E. Lemke","year":"1964","unstructured":"C.E. Lemke and J.T. Howson Jr, Equilibrium points of bimatrix games,SIAM Journal 12 (1964) 413\u2013423.","journal-title":"SIAM Journal"},{"key":"BF02614325_CR50","first-page":"95","volume-title":"Mathematics of Decision Sciences, Part 1","author":"C.E. Lemke","year":"1968","unstructured":"C.E. Lemke, On complementary pivot theory, in: G.B. Dantzig and A.F. Veinott, eds.,Mathematics of Decision Sciences, Part 1 (AMS, Providence, RI, 1968) 95\u2013114."},{"key":"BF02614325_CR51","unstructured":"T.M. Liebling, On the number of iterations of the simplex method, in: R. Henn, H.P. K\u00fcnzi and H. Schubert, eds.,Methods of Operations Research XVII (Verlag Anton, 1972) 248\u2013264."},{"key":"BF02614325_CR52","series-title":"Technical Report SOL","volume-title":"The equivalence of Dantzig\u2019s self-dual parametric algorithm for linear programs to Lemke\u2019s algorithm for linear complementarity problems applied to linear programming","author":"I. Lustig","year":"1987","unstructured":"I. Lustig, The equivalence of Dantzig\u2019s self-dual parametric algorithm for linear programs to Lemke\u2019s algorithm for linear complementarity problems applied to linear programming, Technical Report SOL 87-4, Department of Operations Research, Stanford University, Stanford, California, 1987."},{"key":"BF02614325_CR53","volume-title":"Topology of oriented matroids","author":"A. Mandel","year":"1982","unstructured":"A. Mandel, Topology of oriented matroids, Ph.D. Thesis, Waterloo University, Waterloo, Ontario, 1982."},{"key":"BF02614325_CR54","series-title":"Technical Report","volume-title":"Symmetry and positive definiteness in oriented matroids","author":"W. Morris Jr","year":"1984","unstructured":"W. Morris Jr and M.J. Todd, Symmetry and positive definiteness in oriented matroids, Technical Report No. 631, Cornell University, School of Operations Research and Industrial Engineering, Ithaca, NY, 1984."},{"issue":"2\u20133","key":"BF02614325_CR55","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 (2\u20133) (1974) 123\u2013130.","journal-title":"Opsearch"},{"key":"BF02614325_CR56","volume-title":"Linear and Combinatorial Programming","author":"K.G. Murty","year":"1976","unstructured":"K.G. Murty,Linear and Combinatorial Programming (Krieger Publishing Company, Malabar, FL, 1976)."},{"key":"BF02614325_CR57","doi-asserted-by":"crossref","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,Mathematical Programming 19 (1980) 213\u2013219.","journal-title":"Mathematical Programming"},{"key":"BF02614325_CR58","series-title":"Research Report","volume-title":"Some modifications of the criss-cross method","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, 1990."},{"issue":"2","key":"BF02614325_CR59","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 (2) (1989) 77\u201395.","journal-title":"Opsearch"},{"key":"BF02614325_CR60","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF01585729","volume":"46","author":"C. Roos","year":"1990","unstructured":"C. Roos, An exponential example for Terlaky\u2019s pivoting rule for the criss-cross simplex method,Mathematical Programming 46 (1990) 78\u201394.","journal-title":"Mathematical Programming"},{"key":"BF02614325_CR61","volume-title":"Theory and Algorithms for Linear Optimization: An Interior Point Approach","author":"C. Roos","year":"1997","unstructured":"C. Roos, T. Terlaky and J.-Ph. Vial,Theory and Algorithms for Linear Optimization: An Interior Point Approach (John Wiley & Sons, New York, 1997)."},{"key":"BF02614325_CR62","volume-title":"Introduction to Linear Programming","author":"J.E. Strum","year":"1972","unstructured":"J.E. Strum,Introduction to Linear Programming (Holden-Day, San Francisco, CA, 1972)."},{"key":"BF02614325_CR63","first-page":"289","volume":"10","author":"T. Terlaky","year":"1984","unstructured":"T. Terlaky, Egy \u00faj, v\u00e9ges criss-cross m\u00f3dszer programoz\u00e1si feladatok megold\u00e1s\u00e1ra,Alkalmazott Matematikai Lapok 10 (1984) 289\u2013296 (in Hungarian, English title: A new, finite criss-cross method for solving linear programming problems).","journal-title":"Alkalmazott Matematikai Lapok"},{"issue":"5","key":"BF02614325_CR64","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 (5) (1985) 683\u2013690.","journal-title":"Math. Oper. und Stat. ser. Optimization"},{"issue":"3","key":"BF02614325_CR65","doi-asserted-by":"crossref","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,Journal of Combinatorial Theory, Series B 42 (3) (1987) 319\u2013327.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02614325_CR66","volume-title":"Interior Point Methods of Mathematical Programming","year":"1996","unstructured":"T. Terlaky, ed.,Interior Point Methods of Mathematical Programming (Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996)."},{"key":"BF02614325_CR67","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","volume":"46","author":"T. Terlaky","year":"1993","unstructured":"T. Terlaky and S. Zhang, Pirvot rules for linear programming: A survey on recent theoretical developments,Annals of Operations Research 46 (1993) 203\u2013233.","journal-title":"Annals of Operations Research"},{"key":"BF02614325_CR68","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0605046","volume":"5","author":"M.J. Todd","year":"1984","unstructured":"M.J. Todd, Complementarity in oriented matroids,SIAM Journal on Algebraic and Discrete Mathematics 5 (1984) 467\u2013485.","journal-title":"SIAM Journal on Algebraic and Discrete Mathematics"},{"key":"BF02614325_CR69","doi-asserted-by":"crossref","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,Journal of Combinatorial Theory, Series B 39 (1985) 105\u2013133.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02614325_CR70","doi-asserted-by":"crossref","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,Mathematical Programming 35 (1986) 173\u2013192.","journal-title":"Mathematical Programming"},{"issue":"2","key":"BF02614325_CR71","doi-asserted-by":"crossref","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,Mathematics of Operations Research 2 (2) (1977) 143\u2013144.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614325_CR72","first-page":"391","volume":"25","author":"H. V\u00e4liaho","year":"1992","unstructured":"H. V\u00e4liaho, A new proof of the finiteness of the criss-cross method,Math. Oper. und Stat. ser. Optimization 25 (1992) 391\u2013400.","journal-title":"Math. Oper. und Stat. ser. Optimization"},{"key":"BF02614325_CR73","first-page":"103","volume":"239","author":"H. V\u00e4liaho","year":"1996","unstructured":"H. V\u00e4liaho,P *-matrices are just sufficient,Linear Algebra and Its Applications 239 (1996) 103\u2013108.","journal-title":"Linear Algebra and Its Applications"},{"key":"BF02614325_CR74","unstructured":"Zh. Wang, A conformal elimination free algorithm for oriented matroid programming,Chinese Annals of Mathematics 8 (B1) (1987)."},{"key":"BF02614325_CR75","unstructured":"Zh. Wang, A modified version of the Edmonds-Fukuda algorithm for LP in the general form,Asia-Pacific Journal of Operations Research 8 (1) (1991)."},{"key":"BF02614325_CR76","unstructured":"Zh. Wang, A general deterministic pivot method for oriented matroid programming,Chinese Annals of Mathematics B 13 (2) (1992)."},{"key":"BF02614325_CR77","first-page":"244","volume-title":"Combinatorics and Graph Theory, Proceedings of the Spring School and International Conference on Combinatorics: SSIC\u201992","author":"Zh. Wang","year":"1993","unstructured":"Zh. Wang and T. Terlaky, A general scheme for solving linear complementarity problems in the setting of oriented matroids, in: H.P. Yap, T.H. Ku, E.K. Lloyd and Zh. Wang, eds.,Combinatorics and Graph Theory, Proceedings of the Spring School and International Conference on Combinatorics: SSIC\u201992, China (World Scientific, Singapore, 1993) 244\u2013255."},{"key":"BF02614325_CR78","volume-title":"Primal-Dual Interior Point Methods","author":"S.J. Wright","year":"1996","unstructured":"S.J. Wright,Primal-Dual Interior Point Methods (SIAM Publications, Philadelphia, PA, 1996)."},{"key":"BF02614325_CR79","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, 1980."},{"key":"BF02614325_CR80","doi-asserted-by":"crossref","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,Operations Research Letters 10 (1991) 189\u2013192.","journal-title":"Operations Research Letters"},{"key":"BF02614325_CR81","unstructured":"S. Zhang, New variants of finite criss-cross pivot algorithms for linear programming, Technical Report, Econometric Institute, Erasmus University Rotterdam, 9707\/A, 1997."},{"issue":"7","key":"BF02614325_CR82","doi-asserted-by":"crossref","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,Management Science 15 (7) (1969) 426\u2013445.","journal-title":"Management Science"},{"key":"BF02614325_CR83","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1287\/mnsc.19.4.406","volume":"19","author":"S. Zionts","year":"1972","unstructured":"S. Zionts, Some empirical test of the criss-cross method,Management Science 19 (1972) 406\u2013410.","journal-title":"Management Science"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614325.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02614325\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:49:23Z","timestamp":1558327763000},"score":1,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":83,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["BF02614325"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf02614325","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":["General Mathematics","Software"],"published":{"date-parts":[[1997,10]]}}}