{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:45:46Z","timestamp":1725630346096},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,8]]},"DOI":"10.1016\/s0377-2217(98)00026-5","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"607-614","source":"Crossref","is-referenced-by-count":10,"title":["New variants of finite criss-cross pivot algorithms for linear programming"],"prefix":"10.1016","volume":"116","author":[{"given":"Shuzhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00026-5_BIB1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0167-6377(91)90058-W","article-title":"On anti-cycling pivoting rules for the simplex method","volume":"10","author":"Zhang","year":"1991","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB2","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/mnsc.15.7.426","article-title":"The criss-cross method for solving linear programming problems","volume":"15","author":"Zionts","year":"1969","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB3","unstructured":"Y.Y. Chang, Least index resolution of degeneracy in linear complementarity problems, Tedchnical Report 79-14, Department of Operations Research, Stanford University, Stanford, CA, 1979"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB4","unstructured":"T. Terlaky, Egy \u00faj, v\u00e9ges criss-cross m\u00f3dszer line\u00e1ris 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)"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB5","first-page":"683","article-title":"A convergent criss-cross method","volume":"16","author":"Terlaky","year":"1985","journal-title":"Mathematische Operationsforschung und Statistik Series Optimization"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB6","unstructured":"Z. Wang, A conformal elimination-free algorithm for oriented matroid programming, Annals of Mathematics 8 (B1) 1987"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","article-title":"New finite pivoting rules for the simplex method","volume":"2","author":"Bland","year":"1977","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(98)00026-5_BIB8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0095-8956(87)90049-9","article-title":"A finite criss-cross method for oriented matroids","volume":"42","author":"Terlaky","year":"1987","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(93)90124-7","article-title":"The linear complementarity problems, sufficient matrices and the criss-cross method","volume":"187","author":"Den Hertog","year":"1993","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0024-3795(91)90356-2","article-title":"The role of pivoting in proving some fundamental theorems of linear algebra","volume":"151","author":"Klafszky","year":"1991","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB11","first-page":"127","article-title":"Some generalization of the criss-cross method for quadratic programming","volume":"24","author":"Klafszky","year":"1992","journal-title":"Mathematische Operationsforschung und Statistik Series Optimization"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB12","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02614325","article-title":"Criss-cross methods: A fresh view on pivot algorithms","volume":"B 79","author":"Fukuda","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","article-title":"Pivot rules for linear programming: A survey on recent theoretical developments","volume":"46","author":"Terlaky","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB14","doi-asserted-by":"crossref","unstructured":"K. Fukuda, H.-J. L\u00fcthi, M. Namiki, The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP, Technical Report, Institute for Operations Research, ETH-Zentrum, Zurich, Switzerland, 1996","DOI":"10.1111\/j.1475-3995.1997.tb00083.x"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB15","unstructured":"V. Chv\u00e1tal, Linear Programming, Freeman, New York, 1983"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB16","unstructured":"D. Jensen, Coloring and duality: Combinatorial augumentation methods, Ph.D. Thesis, School of OR and IE, Cornell University, Ithaca, NY, 1985"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB17","unstructured":"K. Fukuda, Oriented matroid programming, Ph.D. Thesis, Waterloo University, Waterloo, Ont., 1982"},{"key":"10.1016\/S0377-2217(98)00026-5_BIB18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(91)90343-T","article-title":"On the finiteness of the criss-cross method","volume":"52","author":"Fukuda","year":"1991","journal-title":"European Journal of Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798000265?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798000265?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T23:53:57Z","timestamp":1680911637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798000265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["S0377221798000265"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00026-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}