{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T12:02:33Z","timestamp":1774526553058,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf02023111","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T06:28:34Z","timestamp":1123828114000},"page":"497-508","source":"Crossref","is-referenced-by-count":23,"title":["An exterior point simplex algorithm for (general) linear programming problems"],"prefix":"10.1007","volume":"46-47","author":[{"given":"Konstantinos","family":"Paparrizos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02023111_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, Notes on Bland's rule, Math. Progr. Study 8 (1978) 24.","journal-title":"Math. Progr. Study"},{"key":"BF02023111_CR2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/nav.3800020406","volume":"2","author":"E.M.L. Beale","year":"1955","unstructured":"E.M.L. Beale, Cycling in the dual simplex algorithm, Naval Res. Log. Quarterly 2 (1955) 269.","journal-title":"Naval Res. Log. Quarterly"},{"key":"BF02023111_CR3","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, Math. Oper. Res. 2 (1977) 103.","journal-title":"Math. Oper. Res."},{"key":"BF02023111_CR4","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, Eur. J. Oper. Res. 29 (1987) 378.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02023111_CR5","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":"BF02023111_CR6","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":"BF02023111_CR7","unstructured":"D. Goldfarb, Worst case complexity of the shadow vertex simplex algorithm, Columbia University, Department of Industrial Engineering and Operations Research (1983)."},{"key":"BF02023111_CR8","first-page":"27","volume":"3","author":"M. Iri","year":"1960","unstructured":"M. Iri, A new method of solving transportation network problems, J. Oper. Res. Soc. Japan 3 (1960) 27.","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"BF02023111_CR9","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, The simplex algorithm with the pivot rule of maximizing criterion improvement, Discr. Math. 4 (1973) 367.","journal-title":"Discr. Math."},{"key":"BF02023111_CR10","series-title":"Interim Technical Report","volume-title":"Optimal flow through networks","author":"W.S. Jewell","year":"1985","unstructured":"W.S. Jewell, Optimal flow through networks, Interim Technical Report No. 8, Operations Research Centre, M.I.T., Cambridge, MA (1985)."},{"key":"BF02023111_CR11","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:Inequalities- III, ed. O. Shisha (Academic Press, New York, 1972) p. 159."},{"key":"BF02023111_CR12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/nav.3800030404","volume":"3","author":"H.W. Kuhn","year":"1955","unstructured":"H.W. Kuhn, The Hungarian method for the assignment problem, Naval Res. Log. Quarterly 3 (1955) 253.","journal-title":"Naval Res. Log. Quarterly"},{"key":"BF02023111_CR13","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/nav.3800010107","volume":"1","author":"C.E. Lemke","year":"1955","unstructured":"C.E. Lemke, The dual method of solving the linear programming problem, Naval Res. Log. Quarterly 1 (1955) 36.","journal-title":"Naval Res. Log. Quarterly"},{"key":"BF02023111_CR14","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 programming, Math. Progr. 19 (1980) 213.","journal-title":"Math. Progr."},{"key":"BF02023111_CR15","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.","journal-title":"Opsearch"},{"key":"BF02023111_CR16","doi-asserted-by":"crossref","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.","journal-title":"Math. Progr."},{"key":"BF02023111_CR17","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's pivoting rule for the criss-cross simplex method, Math. Progr. 46 (1990) 78.","journal-title":"Math. Progr."},{"key":"BF02023111_CR18","first-page":"683","volume":"16","author":"T. Terlaky","year":"1985","unstructured":"T. Terlaky, A convergent criss-cross method, Math. Oper. Stat. Ser. Optim. 16 (1985) 683.","journal-title":"Math. Oper. Stat. Ser. Optim."},{"key":"BF02023111_CR19","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 of the simplex method, Oper. Res. Lett. 10 (1991) 189.","journal-title":"Oper. Res. Lett."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023111.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023111\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T18:39:58Z","timestamp":1557772798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF02023111"],"URL":"https:\/\/doi.org\/10.1007\/bf02023111","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}