{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:17:59Z","timestamp":1774973879261,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,6,5]],"date-time":"2015-06-05T00:00:00Z","timestamp":1433462400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s12532-015-0083-5","type":"journal-article","created":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T16:37:06Z","timestamp":1433435826000},"page":"367-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Progress in presolving for mixed integer programming"],"prefix":"10.1007","volume":"7","author":[{"given":"Gerald","family":"Gamrath","sequence":"first","affiliation":[]},{"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Miltenberger","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Weninger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,5]]},"reference":[{"issue":"3","key":"83_CR1","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.12.3.192.12635","volume":"12","author":"K Aardal","year":"2000","unstructured":"Aardal, K., Bixby, R.E., Hurkens, C.A.J., Lenstra, A.K., Smeltink, J.W.: Market split and basis reduction: towards a solution of the Cornu\u00e9jols\u2013Dawande instances. INFORMS J. Comput. 12(3), 192\u2013202 (2000)","journal-title":"INFORMS J. Comput."},{"key":"83_CR2","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin (2007)"},{"issue":"1","key":"83_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"83_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 1\u201312 (2006)","journal-title":"Oper. Res. Lett."},{"key":"83_CR5","first-page":"221","volume":"71","author":"ED Andersen","year":"1995","unstructured":"Andersen, E.D., Andersen, K.D.: Presolving in linear programming. Math. Program. 71, 221\u2013245 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"83_CR6","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., Savelsbergh, M.W.P.: Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121(1), 40\u201355 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"83_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10479-005-3968-2","volume":"140","author":"A Atamt\u00fcrk","year":"2005","unstructured":"Atamt\u00fcrk, A., Savelsbergh, M.W.P.: Integer-programming software systems. Ann. Oper. Res. 140, 67\u2013124 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"83_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01300969","volume":"3","author":"DA Babayev","year":"1994","unstructured":"Babayev, D.A., Mardanov, S.S.: Reducing the number of variables in integer and linear programming problems. Comput. Optim. Appl. 3(2), 99\u2013109 (1994)","journal-title":"Comput. Optim. Appl."},{"key":"83_CR9","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315 (1998)"},{"key":"83_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"RE Bixby","year":"2007","unstructured":"Bixby, R.E., Rothberg, E.: Progress in computational mixed integer programming-a look back from the other side of the tipping point. Ann. Oper. Res. 149, 37\u201341 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"83_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0167-6377(87)90004-6","volume":"6","author":"RE Bixby","year":"1987","unstructured":"Bixby, R.E., Wagner, D.K.: A note on detecting simple redundancies in linear systems. Oper. Res. Lett. 6(1), 15\u201317 (1987)","journal-title":"Oper. Res. Lett."},{"key":"83_CR12","unstructured":"Bornd\u00f6rfer, R.: Aspects of set packing, partitioning, and covering. PhD thesis, Technische Universit\u00e4t Berlin (1998)"},{"key":"83_CR13","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","volume":"8","author":"AL Brearley","year":"1975","unstructured":"Brearley, A.L., Mitra, G., Williams, H.P.: Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 8, 54\u201383 (1975)","journal-title":"Math. Program."},{"issue":"5","key":"83_CR14","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., Padberg, M.: Solving large-scale zero-one linear programming problems. Oper. Res. 31(5), 803\u2013834 (1983)","journal-title":"Oper. Res."},{"issue":"2","key":"83_CR15","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig, G.B.: Discrete-variable extremum problems. Oper. Res. 5(2), 266\u2013277 (1957)","journal-title":"Oper. Res."},{"key":"83_CR16","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Karp, R.M., Mossel, E., Riesenfeld, S., Verbin, E.L.: Sorting and selection in posets. In: SODA \u201909: Proceedings of the Nineteenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 392\u2013401. Society for Industrial and Applied Mathematics, Philadelphia (2009)","DOI":"10.1137\/1.9781611973068.44"},{"key":"83_CR17","doi-asserted-by":"crossref","unstructured":"F\u00fcgenschuh, A., Martin, A.: Computational integer programming and cutting planes. In: Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.) Discrete Optimization. Handbooks in Operations Research and Management Science, vol. 12, chap. 2, pp. 69\u2013122. Elsevier, Amsterdam (2005)","DOI":"10.1016\/S0927-0507(05)12002-7"},{"issue":"1","key":"83_CR18","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.29.1.49","volume":"29","author":"M Guignard","year":"1981","unstructured":"Guignard, M., Spielberg, K.: Logical reduction methods in zero-one programming: minimal preferred variables. Oper. Res. 29(1), 49\u201374 (1981)","journal-title":"Oper. Res."},{"issue":"2","key":"83_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"KL Hoffman","year":"1991","unstructured":"Hoffman, K.L., Padberg, M.: Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA J. Comput. 3(2), 121\u2013134 (1991)","journal-title":"ORSA J. Comput."},{"issue":"6","key":"83_CR20","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"issue":"1","key":"83_CR21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(80)90053-0","volume":"2","author":"EL Johnson","year":"1980","unstructured":"Johnson, E.L., Suhl, U.H.: Experiments in integer programming. Discrete Appl. Math. 2(1), 39\u201355 (1980)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"83_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"83_CR23","doi-asserted-by":"crossref","unstructured":"Mahajan, A.: Presolving mixed-integer linear programs. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds) Wiley Encyclopedia of Operations Research and Management Science, pp. 4141\u20134149. Wiley, New York (2011)","DOI":"10.1002\/9780470400531.eorms0437"},{"key":"83_CR24","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"83_CR25","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6, 445\u2013454 (1994)","journal-title":"ORSA J. Comput."},{"issue":"4","key":"83_CR26","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01299207","volume":"3","author":"U Suhl","year":"1994","unstructured":"Suhl, U., Szymanski, R.: Supernode processing of mixed-integer models. Comput. Optim. Appl. 3(4), 317\u2013331 (1994)","journal-title":"Comput. Optim. Appl."},{"key":"83_CR27","doi-asserted-by":"crossref","unstructured":"Williams, H.P.: A reduction procedure for linear and integer programming models. In: Redundancy in Mathematical Programming. Lecture Notes in Economics and Mathematical Systems, vol. 206, pp. 87\u2013107. Springer, Berlin (1983)","DOI":"10.1007\/978-3-642-45535-3_9"},{"issue":"5","key":"83_CR28","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1057\/jors.1992.65","volume":"43","author":"HP Williams","year":"1992","unstructured":"Williams, H.P.: The elimination of integer variables. J. Oper. Res. Soc. 43(5), 387\u2013393 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"83_CR29","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"},{"key":"83_CR30","unstructured":"Wunderling, R.: Paralleler und objektorientierter Simplex-Algorithmus. PhD thesis, Technische Universit\u00e4t Berlin (1996)"},{"issue":"3","key":"83_CR31","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1008675522511","volume":"8","author":"N Zhu","year":"1997","unstructured":"Zhu, N., Broughan, K.: A note on reducing the number of variables in integer programming problems. Comput. Optim. Appl. 8(3), 263\u2013272 (1997)","journal-title":"Comput. Optim. Appl."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-015-0083-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-015-0083-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-015-0083-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T12:15:58Z","timestamp":1559477758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-015-0083-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,5]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["83"],"URL":"https:\/\/doi.org\/10.1007\/s12532-015-0083-5","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,5]]}}}