{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:14:48Z","timestamp":1761894888924},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1016\/j.cor.2009.03.020","type":"journal-article","created":{"date-parts":[[2009,4,3]],"date-time":"2009-04-03T04:31:12Z","timestamp":1238733072000},"page":"91-98","source":"Crossref","is-referenced-by-count":14,"title":["A new version of the Improved Primal Simplex for degenerate linear programs"],"prefix":"10.1016","volume":"37","author":[{"given":"Vincent","family":"Raymond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Soumis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Orban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2009.03.020_bib1","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":"Mathematical of Operations Research"},{"key":"10.1016\/j.cor.2009.03.020_bib2","doi-asserted-by":"crossref","first-page":"160","DOI":"10.2307\/1907845","article-title":"Optimality and degeneracy in linear programming","volume":"20","author":"Charnes","year":"1952","journal-title":"Econometrica"},{"key":"10.1016\/j.cor.2009.03.020_bib3","series-title":"Linear programming and extensions","author":"Dantzig","year":"1963"},{"issue":"1","key":"10.1016\/j.cor.2009.03.020_bib4","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1137\/S0895479894246905","article-title":"An unsymmetric-pattern multifontal method for sparse LU factorization","volume":"18","author":"Davis","year":"1997","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10.1016\/j.cor.2009.03.020_bib5","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1287\/opre.1050.0222","article-title":"Dynamic aggregation of set partitioning constraints in column generation","volume":"53","author":"Elhallaoui","year":"2005","journal-title":"Operations Research"},{"key":"10.1016\/j.cor.2009.03.020_bib6","doi-asserted-by":"crossref","unstructured":"Elhallaoui I, Metrane A, Soumis F, Desaulniers G. Multi-phase dynamic constraint aggregation for set partitioning type problems. Mathematical Programming, 2008, doi:10.1007\/S10107-008-0254-5.","DOI":"10.1007\/s10107-008-0254-5"},{"key":"10.1016\/j.cor.2009.03.020_bib7","unstructured":"Elhallaoui I, Metrane A, Desaulniers G, Soumis F. An improved primal simplex algorithm for degenerate linear programs. Operations Research, 2008, submitted for publication."},{"key":"10.1016\/j.cor.2009.03.020_bib8","first-page":"286","article-title":"Anstreicher\u2013Terlaky type monotonic simplex algorithms for linear feasibility problems","volume":"35","author":"Filiz","year":"2001","journal-title":"Operations Research Report"},{"key":"10.1016\/j.cor.2009.03.020_bib9","unstructured":"Fukuda K. Oriented Matroid Programming. PhD thesis, University of Waterloo, Canada; 1982."},{"key":"10.1016\/j.cor.2009.03.020_bib10","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/trsc.35.3.286.10153","article-title":"Simultaneous vehicle and crew scheduling in urban mass transit systems","volume":"35","author":"Haase","year":"2001","journal-title":"Transportation Science"},{"key":"10.1016\/j.cor.2009.03.020_bib11","unstructured":"Omer J. M\u00e9thode de R\u00e9duction Dynamique de Contraintes pour un Programme Lin\u00e9aire. Masters thesis, \u00c9cole Polytechnique de Montral; 2006."},{"issue":"3","key":"10.1016\/j.cor.2009.03.020_bib12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0898-1221(98)00127-8","article-title":"A basis deficiency-allowing variation of the simplex method for linear programming","volume":"36","author":"Pan","year":"1998","journal-title":"Computers and Mathematics with Applications"},{"key":"10.1016\/j.cor.2009.03.020_bib13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01580776","article-title":"On the solution to highly degenerate linear programmes","volume":"41","author":"Ryan","year":"1988","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cor.2009.03.020_bib14","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\/j.cor.2009.03.020_bib15","first-page":"205","article-title":"A technique for resolving degeneracy in LP","volume":"2","author":"Wolfe","year":"1963","journal-title":"SIAM Journal"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054809000999?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054809000999?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T05:06:39Z","timestamp":1558242399000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054809000999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["S0305054809000999"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2009.03.020","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}