{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T06:08:00Z","timestamp":1775887680891,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"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":[[1995,12]]},"DOI":"10.1007\/bf01586000","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:35:26Z","timestamp":1114662926000},"page":"221-245","source":"Crossref","is-referenced-by-count":124,"title":["Presolving in linear programming"],"prefix":"10.1007","volume":"71","author":[{"given":"Erling D.","family":"Andersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Knud D.","family":"Andersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"CR1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1.2.84","volume":"1","author":"I. Adler","year":"1989","unstructured":"I. Adler, N. Karmarkar, M.G.C. Resende and G. Veiga, \u201cData structures and programming techniques for the implementation of Karmarkar's algorithm,\u201dORSA Journal on Computing 1 (2) (1989) 84\u2013106.","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"I. Adler, M.G.C. Resende, G. Veiga and N. Karmarkar, \u201cAn implementation of Karmarkar's algorithm for linear programming,\u201dMathematical Programming 44 (3) (1989) 297\u2013335.","journal-title":"Mathematical Programming"},{"issue":"1","key":"CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1147\/sj.311.0071","volume":"31","author":"R. Anbil","year":"1992","unstructured":"R. Anbil, R. Tanga and E.L. Johnson, \u201cA global approach to crew-pairing optimization,\u201dIBM Systems Journal 31 (1) (1992) 71\u201378.","journal-title":"IBM Systems Journal"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"E.D. Andersen, \u201cFinding all linearly dependent rows in large-scale linear programming,\u201dOptimization Methods and Software, to appear.","DOI":"10.1080\/10556789508805634"},{"issue":"3","key":"CR5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/ijoc.4.3.267","volume":"4","author":"R.E. Bixby","year":"1992","unstructured":"R.E. Bixby, \u201cImplementing the simplex method: The initial basis,\u201dORSA Journal on Computing 4 (3) (1992) 267\u2013284.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/ijoc.6.1.15","volume":"6","author":"R.E. Bixby","year":"1994","unstructured":"R.E. Bixby, \u201cProgress in linear programming,\u201dORSA Journal on Computing 6 (1) (1994) 15\u201322.","journal-title":"ORSA Journal on Computing"},{"issue":"5","key":"CR7","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1287\/opre.40.5.885","volume":"40","author":"R.E. Bixby","year":"1992","unstructured":"R.E. Bixby, J.W. Gregory, I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cVery large-scale linear programming: A case study in combining interior point and simplex methods,\u201dOperations Research 40 (5) (1992) 885\u2013897.","journal-title":"Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-642-45535-3_12","volume-title":"Redundancy in Mathematical Programming","author":"G.H. Bradley","year":"1983","unstructured":"G.H. Bradley, G.G. Brown and G.W. Graves, \u201cStructural redundancy in large-scale optimization models,\u201d in: M.H. Karwan et al., eds.,Redundancy in Mathematical Programming (Springer, Berlin, 1983) pp. 145\u2013169."},{"issue":"1","key":"CR9","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","volume":"8","author":"A.L. Brearley","year":"1975","unstructured":"A.L. Brearley, G. Mitra and H.P. Williams, \u201cAnalysis of mathematical programming problems prior to applying the simplex algorithm,\u201dMathematical Programming 8 (1) (1975) 54\u201383.","journal-title":"Mathematical Programming"},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/opre.38.2.240","volume":"38","author":"W.J. Carolan","year":"1990","unstructured":"W.J. Carolan, J.E. Hill, J.L. Kennington, S. Niemi and S.J. Wichman, \u201cAn empirical evaluation of the KORBX algorithms for military airlift applications,\u201dOperations Research 38 (2) (1990) 240\u2013248.","journal-title":"Operations Research"},{"issue":"1","key":"CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580890","volume":"56","author":"S.F. Chang","year":"1992","unstructured":"S.F. Chang and S.T. McCormick, \u201cA hierachical algorithm for making sparse matrices sparser,\u201dMathematical Programming 56 (1) (1992) 1\u201330.","journal-title":"Mathematical Programming"},{"issue":"1","key":"CR12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1147\/sj.311.0011","volume":"31","author":"J.J.H. Forrest","year":"1992","unstructured":"J.J.H. Forrest and J.A. Tomlin, \u201cImplementing the simplex method for optimization subroutine library,\u201dIBM Systems Journal 31 (1) (1992) 11\u201325.","journal-title":"IBM Systems Journal"},{"key":"CR13","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201dCOAL Newsletter 13 (1985) 10\u201312.","journal-title":"COAL Newsletter"},{"issue":"3","key":"CR14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo and S. Mizuno, \u201cA primal\u2014dual infeasible-interior-point algorithm for linear programming,\u201dMathematical Programming 61 (3) (1993) 263\u2013280.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I.J. Lustig","year":"1991","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cComputational experience with a primal\u2014dual interior point method for linear programming,\u201dLinear Algebra and its Applications 152 (1991) 191\u2013222.","journal-title":"Linear Algebra and its Applications"},{"key":"CR16","first-page":"190","volume-title":"Advances in Optimization and Parallel Computing","author":"I.J. Lustig","year":"1992","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cThe interaction of algorithms and architectures for interior point methods,\u201d in: P.M. Pardalos, ed.,Advances in Optimization and Parallel Computing (North-Holland, Amsterdam, 1992) pp. 190\u2013205."},{"issue":"3","key":"CR17","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"I.J. Lustig","year":"1992","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cOn implementing Mehrotra's predictor\u2014corrector interior-point method for linear programming,\u201dSIAM Journal on Optimization 2 (3) (1992) 435\u2013449.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01581140","volume":"66","author":"I.J. Lustig","year":"1994","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cComputational experience with a globally convergent primal\u2014dual predictor\u2014corrector algorithm for linear programming,\u201dMathematical Programming 66 (1) (1994) 123\u2013135.","journal-title":"Mathematical Programming"},{"issue":"1","key":"CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"I.J. Lustig","year":"1994","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cInterior point methods for linear programming: Computational state of the art,\u201dORSA Journal on Computing 6 (1) (1994) 1\u201315.","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"CR20","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"S. Mehrotra, \u201cOn the implementation of a primal\u2014dual interior point method,\u201dSIAM Journal on Optimization 2 (4) (1992) 575\u2013601.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"CR21","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF02591947","volume":"27","author":"J.A. Tomlin","year":"1983","unstructured":"J.A. Tomlin and J.S. Welch, \u201cFormal optimization of some reduced linear programming problems,\u201dMathematical Programming 27 (2) (1983) 232\u2013240.","journal-title":"Mathematical Programming"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0167-6377(83)90036-6","volume":"2","author":"J.A. Tomlin","year":"1983","unstructured":"J.A. Tomlin and J.S. Welch, \u201cA pathological case in the reduction of linear programs,\u201dOperations Research Letters 2 (1983) 53\u201357.","journal-title":"Operations Research Letters"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0167-6377(86)90093-3","volume":"5","author":"J.A. Tomlin","year":"1986","unstructured":"J.A. Tomlin and J.S. Welch, \u201cFinding duplicate rows in a linear program,\u201dOperations Research Letters 5 (1986) 7\u201311.","journal-title":"Operations Research Letters"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-642-45535-3_9","volume-title":"Redundancy in Mathematical Programming","author":"H.P. Williams","year":"1983","unstructured":"H.P. Williams, \u201cA reduction procedure for linear and integer programming models,\u201d in: M.H. Karwan et al., eds.,Redundancy in Mathematical Programming (Springer, Berlin, 1983) pp. 87\u2013109."},{"key":"CR25","unstructured":"Scicon LTD, Sciconic user guide v2.00, 1990."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586000.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01586000\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586000","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:32:35Z","timestamp":1556883155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01586000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF01586000"],"URL":"https:\/\/doi.org\/10.1007\/bf01586000","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}