{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:41:58Z","timestamp":1752460918501},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"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":[[1988,5]]},"DOI":"10.1007\/bf01580770","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:52:50Z","timestamp":1114681970000},"page":"317-325","source":"Crossref","is-referenced-by-count":21,"title":["Parametric linear programming and anti-cycling pivoting rules"],"prefix":"10.1007","volume":"41","author":[{"given":"T. L.","family":"Magnanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. B.","family":"Orlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"\u201cThe expected number of pivots needed to solve parametric linear programs and the efficiency of the self-dual simplex method,\u201d Technical Report","author":"I. Adler","year":"1983","unstructured":"I. Adler, \u201cThe expected number of pivots needed to solve parametric linear programs and the efficiency of the self-dual simplex method,\u201d Technical Report, Department of Industrial Engineering and Operations Research, University of California (Berkeley, CA, 1983)."},{"key":"CR2","volume-title":"\u201cA simplex variant solvingm \u00d7 d linear programs in O(min{m 2,d 2}) expected number of pivot steps,\u201d Report UCB CSD 83\/158","author":"I. Adler","year":"1983","unstructured":"I. Adler, R.M. Karp and R. Shamir, \u201cA simplex variant solvingm \u00d7 d linear programs in O(min{m 2,d 2}) expected number of pivot steps,\u201d Report UCB CSD 83\/158, Computer Science Division, University of California (Berkeley, CA, 1983)."},{"key":"CR3","first-page":"259","volume":"2","author":"E.M.L. Beale","year":"1955","unstructured":"E.M.L. Beale, \u201cCycling in the dual simplex algorithm,\u201dNaval Research Logistics Quarterly 2 (1955) 259\u2013276.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR4","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, \u201cNew finite pivoting rules for the simplex method,\u201dMathematics of Operations Research 2 (1977) 103\u2013107.","journal-title":"Mathematics of Operations Research"},{"key":"CR5","first-page":"157","volume":"26","author":"K.H. Borgwardt","year":"1982","unstructured":"K.H. Borgwardt, \u201cThe average number of steps required by the simplex method is polynomial,\u201dZeitschrift f\u00fcr Operations Research 26 (1982) 157\u2013177.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"160","DOI":"10.2307\/1907845","volume":"20","author":"A. Charnes","year":"1952","unstructured":"A. Charnes, \u201cOptimality and degeneracy in linear programming,\u201dEconometrica 20 (1952) 160\u2013170.","journal-title":"Econometrica"},{"key":"CR7","volume-title":"Activity Analysis of Production and Allocation","author":"G.B. Dantzig","year":"1951","unstructured":"G.B. Dantzig, \u201cMaximization of a linear function of variables subject to linear inequalities,\u201d in: T.C. Koopmans, ed.,Activity Analysis of Production and Allocation (John Wiley and Sons, New York, 1951)."},{"key":"CR8","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":"CR9","volume-title":"\u201cThe simplex method is very good!\u2014On the expected number of pivot steps and related properties of random linear programs,\u201d Technical Report","author":"M. Haimovich","year":"1983","unstructured":"M. Haimovich, \u201cThe simplex method is very good!\u2014On the expected number of pivot steps and related properties of random linear programs,\u201d Technical Report, Columbia University (New York, NY, 1983)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BF01580645","volume":"35","author":"N. Megiddo","year":"1986","unstructured":"N. Megiddo, \u201cImproved asymptotic analysis of the average number of steps performed by the self-dual simplex method,\u201dMathematical Programming 35 (1986) 140\u2013172.","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02591902","volume":"27","author":"S. Smale","year":"1983","unstructured":"S. Smale, \u201cOn the average number of steps of the simplex method of linear programming,\u201dMathematical Programming 27 (1983) 241\u2013262.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01580646","volume":"35","author":"M.J. Todd","year":"1986","unstructured":"M.J. Todd, \u201cPolynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems,\u201dMathematical Programming 35 (1986) 173\u2013192.","journal-title":"Mathematical Programming"},{"key":"CR13","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, \u201cLinear and quadratic programming in oriented matroids,\u201dJournal of Combinatorial Theory B 39 (1985) 105\u2013133.","journal-title":"Journal of Combinatorial Theory B"},{"key":"CR14","first-page":"205","volume":"11","author":"P. Wolfe","year":"1963","unstructured":"P. Wolfe, \u201cA technique for resolving degeneracy in linear programming,\u201dJournal of SIAM 11 (1963) 205\u2013211.","journal-title":"Journal of SIAM"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580770.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580770\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:11Z","timestamp":1556896331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["BF01580770"],"URL":"https:\/\/doi.org\/10.1007\/bf01580770","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}