{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T18:40:13Z","timestamp":1769107213387,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0305-0548(02)00226-5","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T09:52:27Z","timestamp":1046771547000},"page":"303-311","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Cycling in linear programming problems"],"prefix":"10.1016","volume":"31","author":[{"given":"Saul I.","family":"Gass","sequence":"first","affiliation":[]},{"given":"Sasirekha","family":"Vinjamuri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00226-5_BIB1","series-title":"Linear programming and extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB2","series-title":"Linear programming: methods and applications","author":"Gass","year":"1985"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB3","series-title":"Cycling in the simplex algorithm, 1953","author":"Hoffman","year":"1953"},{"issue":"4","key":"10.1016\/S0305-0548(02)00226-5_BIB4","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/opre.27.4.848","article-title":"Comments on the possibility of cycling with the simplex method","volume":"27","author":"Gass","year":"1979","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/S0305-0548(02)00226-5_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/nav.3800020406","article-title":"Cycling in the dual simplex method","volume":"2","author":"Beale","year":"1955","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"10.1016\/S0305-0548(02)00226-5_BIB6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/nav.3800110104","article-title":"Cycling in the transportation problem","volume":"11","author":"Gassner","year":"1964","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"10.1016\/S0305-0548(02)00226-5_BIB7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.2307\/1907844","article-title":"Blending aviation gasolines\u2014a study in programming interdependent activities in an integrated oil company","volume":"20","author":"Charnes","year":"1952","journal-title":"Econometrica"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB8","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/BF01584344","article-title":"The efficient solution of large-scale linear programming problems\u2014some algorithmic techniques and computational results","volume":"13","author":"Benichou","year":"1977","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB9","unstructured":"Vinjamuri S. Cycling in linear programming problems. MA Thesis, Department of Mathematics, University of Maryland, College Park, MD, 1998."},{"issue":"1","key":"10.1016\/S0305-0548(02)00226-5_BIB10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/nav.3800160110","article-title":"A note on cycling in the simplex method","volume":"16","author":"Marshall","year":"1969","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF02023103","article-title":"Encounters with degeneracy","volume":"47","author":"Gass","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB12","unstructured":"Yudin DB, Gol'shtein EG. Linear programming. Israel Program of Scientific Translations, Jerusalem, 1965."},{"key":"10.1016\/S0305-0548(02)00226-5_BIB13","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1137\/S0036144595292991","article-title":"Hoffman's circle updated","volume":"39","author":"Lee","year":"1997","journal-title":"SIAM Review"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB14","first-page":"3","article-title":"Duality theory of linear programs\u2014a constructive approach with applications","volume":"11","author":"Balinski","year":"1997","journal-title":"SIAM Review"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB15","series-title":"Linear programming: an introduction to finite improvement algorithms","author":"Solow","year":"1984"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB16","series-title":"Linear and integer programming","author":"Sierksma","year":"1996"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB17","series-title":"Linear programming","author":"Chv\u00e1tal","year":"1983"},{"key":"10.1016\/S0305-0548(02)00226-5_BIB18","series-title":"Linear programs and related problems","author":"Nering","year":"1993"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802002265?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802002265?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T06:50:41Z","timestamp":1759647041000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802002265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0305054802002265"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00226-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Cycling in linear programming problems","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0305-0548(02)00226-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}