{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:27Z","timestamp":1759847787779,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T00:00:00Z","timestamp":1517788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10100-018-0523-1","type":"journal-article","created":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T08:18:37Z","timestamp":1517818717000},"page":"535-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0325-0043","authenticated-orcid":false,"given":"Adrienn","family":"Csizmadia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Csizmadia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Ill\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,5]]},"reference":[{"issue":"1","key":"523_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ejor.2003.08.008","volume":"157","author":"AA Akkeles","year":"2004","unstructured":"Akkeles AA, Balogh L, Ill\u00e9s T (2004) New variants of the criss-cross method for linearly constrained, convex quadratic programming. Eur J Oper Res 157(1):74\u201386","journal-title":"Eur J Oper Res"},{"issue":"3","key":"523_CR2","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1287\/opre.42.3.556","volume":"42","author":"KM Anstreicher","year":"1994","unstructured":"Anstreicher KM, Terlaky T (1994) A monotonic build-up simplex algorithm for linear programming. Oper Res 42(3):556\u2013561","journal-title":"Oper Res"},{"key":"523_CR3","doi-asserted-by":"crossref","unstructured":"Bazaraa MS, Sherali HD, Shetty CM (2006) Nonlinear programming: theory and algorithms. 3rd ed, Wiley-Interscience, Hoboken, NJ","DOI":"10.1002\/0471787779"},{"issue":"4","key":"523_CR4","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1080\/10556780701223541","volume":"22","author":"F Bilen","year":"2007","unstructured":"Bilen F, Csizmadia Z, Ill\u00e9s T (2007) Anstreicher\u2013Terlaky type monotonic simplex algorithms for linear feasibility problems. Optim Methods Softw 22(4):679\u2013695","journal-title":"Optim Methods Softw"},{"key":"523_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"RG Bland","year":"1977","unstructured":"Bland RG (1977) New finite pivoting rules for the simplex method. Math Oper Res 2:103\u2013107","journal-title":"Math Oper Res"},{"key":"523_CR6","volume-title":"Linear programming. A series of books in the mathematical sciences","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal V (1983) Linear programming. A series of books in the mathematical sciences. W. H. Freeman and Company, New York"},{"key":"523_CR7","unstructured":"Csizmadia, ZS (2007) New pivot based methods in linear optimization, and an application in petroleum industry. PhD Thesis, E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences, Budapest. \n                    http:\/\/www.cs.elte.hu\/csisza"},{"issue":"2","key":"523_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1080\/10556780500095009","volume":"21","author":"Z Csizmadia","year":"2006","unstructured":"Csizmadia Z, Ill\u00e9s T (2006) New criss-cross type algorithms for linear complementarity problems with sufficient matrices. Optim Methods Softw 21(2):247\u2013266","journal-title":"Optim Methods Softw"},{"issue":"3","key":"523_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ejor.2012.02.008","volume":"221","author":"Z Csizmadia","year":"2012","unstructured":"Csizmadia Z, Ill\u00e9s T, Nagy A (2012) The s-monotone index selection rules for pivot algorithms of linear programming. Eur J Oper Res 221(3):491\u2013500","journal-title":"Eur J Oper Res"},{"issue":"1","key":"523_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.2478\/ausi-2014-0007","volume":"5","author":"Z Csizmadia","year":"2013","unstructured":"Csizmadia Z, Ill\u00e9s T, Nagy A (2013) The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems. Acta Univ Sapientiae Inform 5(1):103\u2013139","journal-title":"Acta Univ Sapientiae Inform"},{"key":"523_CR11","doi-asserted-by":"publisher","DOI":"10.1515\/9781400884179","volume-title":"Linear programming and extensions","author":"GB Dantzig","year":"1963","unstructured":"Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton"},{"key":"523_CR12","unstructured":"de Klerk E, Roos C, Terlaky T (2004) Nemline\u00e1ris Optimaliz\u00e1l\u00e1s. Oper\u00e1ci\u00f3kutat\u00e1s No. 5., Budapesti K\u00f6zgazdas\u00e1gtudom\u00e1nyi \u00e9s \u00c1llamigazgat\u00e1si Egyetem, Oper\u00e1ci\u00f3kutat\u00e1s Tansz\u00e9k, Budapest"},{"key":"523_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0024-3795(93)90124-7","volume":"187","author":"D Hertog den","year":"1993","unstructured":"den Hertog D, Roos C, Terlaky T (1993) The linear complementarity problem, sufficient matrices and the criss-cross method. Linear Algebra Appl 187:1\u201314","journal-title":"Linear Algebra Appl"},{"issue":"1","key":"523_CR14","first-page":"15","volume":"11","author":"T Ill\u00e9s","year":"2001","unstructured":"Ill\u00e9s T, M\u00e9sz\u00e1ros K (2001) A new and constructive proof of two basic results of linear programming. Yugoslav J Oper Res 11(1):15\u201330","journal-title":"Yugoslav J Oper Res"},{"issue":"1","key":"523_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/02331934.2013.811666","volume":"63","author":"T Ill\u00e9s","year":"2014","unstructured":"Ill\u00e9s T, Nagy A (2014) Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules. Optimization 63(1):49\u201366","journal-title":"Optimization"},{"issue":"2","key":"523_CR16","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0377-2217(02)00061-9","volume":"140","author":"T Ill\u00e9s","year":"2002","unstructured":"Ill\u00e9s T, Terlaky T (2002) Pivot versus interior point methods: pros and cons. Eur J Oper Res 140(2):170\u2013190","journal-title":"Eur J Oper Res"},{"key":"523_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0024-3795(91)90356-2","volume":"151","author":"E Klafszky","year":"1991","unstructured":"Klafszky E, Terlaky T (1991) The role of pivoting in proving some fundamental theorems of linear algebra. Linear Algebra Appl 151:97\u2013118","journal-title":"Linear Algebra Appl"},{"issue":"1\u20132","key":"523_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1080\/02331939208843783","volume":"24","author":"E Klafszky","year":"1992","unstructured":"Klafszky E, Terlaky T (1992) Some generalizations of the criss-cross method for quadratic programming. Optimization 24(1\u20132):127\u2013139","journal-title":"Optimization"},{"key":"523_CR19","unstructured":"Lemke CE, Howson JT Jr (1968) On complementary pivot theory. Mathematics of decision sciences. volume Part 1. AMS, Providence, Rhode Island, pp 95\u2013114"},{"key":"523_CR20","volume-title":"Linear and combinatorial programming","author":"KG Murty","year":"1976","unstructured":"Murty KG (1976) Linear and combinatorial programming. Wiley, New York"},{"key":"523_CR21","unstructured":"Nagy A (2014) On the theory and applications of flexible anti-cycling index selection rules for linear optimization problems. PhD Thesis, E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences, Budapest"},{"issue":"3\u20134","key":"523_CR22","first-page":"289","volume":"10","author":"T Terlaky","year":"1983","unstructured":"Terlaky T (1983) Egy \u00faj, v\u00e9ges criss-cross m\u00f3dszer line\u00e1ris programoz\u00e1si feladatok megold\u00e1s\u00e1ra. Alkalmazott Matematikai Lapok 10(3\u20134):289\u2013296","journal-title":"Alkalmazott Matematikai Lapok"},{"issue":"5","key":"523_CR23","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1080\/02331938508843067","volume":"16","author":"T Terlaky","year":"1985","unstructured":"Terlaky T (1985) A convergent criss-cross method. Optimization 16(5):683\u2013690","journal-title":"Optimization"},{"issue":"1\u20134","key":"523_CR24","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF02096264","volume":"46\/47","author":"T Terlaky","year":"1993","unstructured":"Terlaky T, Zhang S (1993) Pivot rules for linear programming: a survey on recent theoretical developments. Ann Oper Res 46\/47(1\u20134):203\u2013233","journal-title":"Ann Oper Res"},{"key":"523_CR25","first-page":"305","volume":"5","author":"AW Tucker","year":"1963","unstructured":"Tucker AW (1963) Principal pivotal transformations of square matrices. SIAM Rev 5:305","journal-title":"SIAM Rev"},{"key":"523_CR26","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/nav.3800110304","volume":"11","author":"C Panne van de","year":"1964","unstructured":"van de Panne C, Whinston A (1964a) Simplicial methods for quadratic programming. Naval Res Logist 11:273\u2013302","journal-title":"Naval Res Logist"},{"key":"523_CR27","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1057\/jors.1964.60","volume":"15","author":"C Panne van de","year":"1964","unstructured":"van de Panne C, Whinston A (1964b) The simplex and the dual method for quadratic programming. Oper Res Q 15:355\u2013388","journal-title":"Oper Res Q"},{"issue":"2","key":"523_CR28","doi-asserted-by":"publisher","first-page":"354","DOI":"10.2307\/1909938","volume":"34","author":"C Panne van de","year":"1966","unstructured":"van de Panne C, Whinston A (1966) A parametric simplicial formulation of Houthakker\u2019s capacity method. Econometrica 34(2):354\u2013380","journal-title":"Econometrica"},{"issue":"3","key":"523_CR29","doi-asserted-by":"publisher","first-page":"507","DOI":"10.2307\/1912797","volume":"37","author":"C Panne van de","year":"1969","unstructured":"van de Panne C, Whinston A (1969) The symmetric formulation of the simplex method for quadratic programming. Econometrica 37(3):507\u2013527","journal-title":"Econometrica"},{"issue":"3","key":"523_CR30","doi-asserted-by":"publisher","first-page":"382","DOI":"10.2307\/1909468","volume":"27","author":"P Wolfe","year":"1959","unstructured":"Wolfe P (1959) The simplex method for quadratic programming. Econometrica 27(3):382\u2013398","journal-title":"Econometrica"},{"issue":"3","key":"523_CR31","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0377-2217(98)00026-5","volume":"116","author":"S Zhang","year":"1997","unstructured":"Zhang S (1997) A new variant of criss-cross pivot algorithm for linear programming. Eur J Oper Res 116(3):607\u2013614","journal-title":"Eur J Oper Res"},{"issue":"7","key":"523_CR32","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1287\/mnsc.15.7.426","volume":"15","author":"S Zionts","year":"1969","unstructured":"Zionts S (1969) The criss-cross method for solving linear programming problems. Manage Sci 15(7):426\u2013445","journal-title":"Manage Sci"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-018-0523-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0523-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0523-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T19:24:26Z","timestamp":1549308266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-018-0523-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,5]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["523"],"URL":"https:\/\/doi.org\/10.1007\/s10100-018-0523-1","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2018,2,5]]},"assertion":[{"value":"5 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}