{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T03:55:34Z","timestamp":1783396534895,"version":"3.54.6"},"reference-count":40,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T00:00:00Z","timestamp":1597708800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001652","name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001652","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s13675-020-00129-6","type":"journal-article","created":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T04:03:46Z","timestamp":1597723426000},"page":"205-240","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"title":["Two-row and two-column mixed-integer presolve using hashing-based pairing methods"],"prefix":"10.1016","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0784-6696","authenticated-orcid":false,"given":"Patrick","family":"Gemander","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4147-1346","authenticated-orcid":false,"given":"Wei-Kun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1333-8591","authenticated-orcid":false,"given":"Dieter","family":"Weninger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8894-5011","authenticated-orcid":false,"given":"Leona","family":"Gottwald","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7602-3653","authenticated-orcid":false,"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1007\/s13675-020-00129-6_CR1","unstructured":"Achterberg T (2007) Constraint integer programming. Ph.D. thesis, Technische Universit\u00e4t Berlin"},{"key":"10.1007\/s13675-020-00129-6_CR2","series-title":"Mixed integer programming: analyzing 12 years of progress","first-page":"449","author":"Achterberg","year":"2013"},{"key":"10.1007\/s13675-020-00129-6_CR3","unstructured":"Achterberg T, Bixby RE, Gu Z, Rothberg E, Weninger D (2014) Multi-row presolve reductions in mixed integer programming. In: T. Hosei University (ed) Proceedings of the twenty-sixth RAMP symposium, pp 181\u2013196. http:\/\/www.orsj.or.jp\/ramp\/2014\/paper\/4-4.pdf"},{"key":"10.1007\/s13675-020-00129-6_CR4","article-title":"Presolve reductions in mixed integer programming","author":"Achterberg","year":"2019","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-020-00129-6_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01586000","article-title":"Presolving in linear programming","volume":"71","author":"Andersen","year":"1995","journal-title":"Math Program"},{"key":"10.1007\/s13675-020-00129-6_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10479-005-3968-2","article-title":"Integer-programming software systems","volume":"140","author":"Atamt\u00fcrk","year":"2005","journal-title":"Ann Oper Res"},{"issue":"5","key":"10.1007\/s13675-020-00129-6_CR7","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","article-title":"An algorithm for large zero-one knapsack problems","volume":"28","author":"Balas","year":"1980","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13675-020-00129-6_CR8","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1007\/s10898-012-9848-9","article-title":"Bound reduction using pairs of linear inequalities","volume":"56","author":"Belotti","year":"2013","journal-title":"J Glob Optim"},{"key":"10.1007\/s13675-020-00129-6_CR9","doi-asserted-by":"crossref","unstructured":"Belotti P, Cafieri S, Lee J, Liberti L (2010) Feasibility-based bounds tightening via fixed points. In: International conference on combinatorial optimization and applications, pp 65\u201376. Springer, Berlin","DOI":"10.1007\/978-3-642-17458-2_7"},{"issue":"1","key":"10.1007\/s13675-020-00129-6_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0167-6377(87)90004-6","article-title":"A note on detecting simple redundancies in linear systems","volume":"6","author":"Bixby","year":"1987","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13675-020-00129-6_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","article-title":"Progress in computational mixed integer programming\u2014a look back from the other side of the tipping point","volume":"149","author":"Bixby","year":"2007","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-020-00129-6_CR12","series-title":"The sharpest cut: the impact of Manfred Padberg and his work, MPS-SIAM series on optimization, chapter 18","first-page":"309","article-title":"Mixed-integer programming: a progress report","author":"Bixby","year":"2004"},{"key":"10.1007\/s13675-020-00129-6_CR13","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","article-title":"Analysis of mathematical programming problems prior to applying the simplex algorithm","volume":"8","author":"Brearley","year":"1975","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-020-00129-6_CR14","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/155743.152620","article-title":"Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser","volume":"19","author":"Chang","year":"1993","journal-title":"ACM Trans Math Softw"},{"issue":"5","key":"10.1007\/s13675-020-00129-6_CR15","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero-one linear programming problems","volume":"31","author":"Crowder","year":"1983","journal-title":"Oper Res"},{"key":"10.1007\/s13675-020-00129-6_CR16","unstructured":"Danna E (2008) Performance variability in mixed integer programming. In: Presentation at workshop on mixed integer programming"},{"issue":"2","key":"10.1007\/s13675-020-00129-6_CR17","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","article-title":"Discrete-variable extremum problems","volume":"5","author":"Dantzig","year":"1957","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13675-020-00129-6_CR18","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","article-title":"Constraint propagation with interval labels","volume":"32","author":"Davis","year":"1987","journal-title":"Artif intell"},{"key":"10.1007\/s13675-020-00129-6_CR19","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s12532-015-0083-5","article-title":"Progress in presolving for mixed integer programming","volume":"7","author":"Gamrath","year":"2015","journal-title":"Math Program Comput"},{"key":"10.1007\/s13675-020-00129-6_CR20","unstructured":"Gamrath G, Fischer T, Gally T, Gleixner A, Hendel G, Koch T, Maher SJ, Miltenberger M, \u00fcller BM, Pfetsch ME, Puchert C, Rehfeldt D, Schenker S, Schwarz R, Serrano F, Shinano Y, Vigerske S, Weninger D, Winkler M, Witt J.T, Witzig J (2016) The SCIP optimization suite 3.2. Technical report 15-60, ZIB, Berlin"},{"key":"10.1007\/s13675-020-00129-6_CR21","unstructured":"Gleixner A, Eifler L, Gally T, Gamrath G, Gemander P, Gottwald R.L, Hendel G, Hojny C, Koch T, Miltenberger M, M\u00fcller B, Pfetsch ME, Puchert C, Rehfeldt D, Schl\u00f6sser F, Serrano F, Shinano Y, Viernickel JM, Vigerske S, Weninger D, Witt JT, Witzig J (2017) The SCIP optimization suite 5.0. Technical report, optimization online. http:\/\/www.optimization-online.org\/DB_HTML\/2017\/12\/6385.html"},{"key":"10.1007\/s13675-020-00129-6_CR22","unstructured":"Gleixner A, Hendel G, Gamrath G, Achterberg T, Bastubbe M, Berthold T, Christophel PM, Jarck K, Koch T, Linderoth J, L\u00fcbbecke M, Mittelmann HD, Ozyurt D, Ralphs TK, Salvagnin D, Shinano Y (2019) MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Technical report, optimization online. http:\/\/www.optimization-online.org\/DB_HTML\/2019\/07\/7285.html"},{"issue":"1","key":"10.1007\/s13675-020-00129-6_CR23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/ijoc.9.1.73","article-title":"Presolve analysis of linear programs prior to applying an interior point method","volume":"9","author":"Gondzio","year":"1997","journal-title":"INFORMS J Comput"},{"issue":"1","key":"10.1007\/s13675-020-00129-6_CR24","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.29.1.49","article-title":"Logical reduction methods in zero-one programming: minimal preferred variables","volume":"29","author":"Guignard","year":"1981","journal-title":"Oper Res"},{"issue":"2","key":"10.1007\/s13675-020-00129-6_CR25","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","article-title":"Improving LP-representations of zero-one linear programs for branch-and-cut","volume":"3","author":"Hoffman","year":"1991","journal-title":"ORSA J Comput"},{"issue":"1","key":"10.1007\/s13675-020-00129-6_CR26","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(80)90053-0","article-title":"Experiments in integer programming","volume":"2","author":"Johnson","year":"1980","journal-title":"Discrete Appl Math"},{"key":"10.1007\/s13675-020-00129-6_CR27","series-title":"The art of computer programming. Sorting and searching","author":"Knuth","year":"1998"},{"key":"10.1007\/s13675-020-00129-6_CR28","unstructured":"K\u00fc\u00e7\u00fckyavuz S (2019) Tsccp testset. http:\/\/faculty.washington.edu\/simge\/IntMixOS.zip"},{"issue":"1","key":"10.1007\/s13675-020-00129-6_CR29","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10107-018-1231-2","article-title":"On intersection of two mixing sets with applications to joint chance-constrained programs","volume":"175","author":"Liu","year":"2019","journal-title":"Math Program"},{"key":"10.1007\/s13675-020-00129-6_CR30","article-title":"Performance variability in mixed-integer programming","author":"Lodi","year":"2013","journal-title":"Tutor Oper Res"},{"key":"10.1007\/s13675-020-00129-6_CR31","unstructured":"Maher SJ, Fischer T, Gally T, Gamrath G, Gleixner A, Gottwald RL, Hendel G, Koch T, L\u00fcbbecke ME, Miltenberger M, et al (2017) The SCIP optimization suite 4.0. Technical report, ZIB, Berlin"},{"key":"10.1007\/s13675-020-00129-6_CR32","series-title":"Computational combinatorial optmization","first-page":"1","article-title":"General mixed integer programming: computational issues for branch-and-cut algorithms","author":"Martin","year":"2001"},{"key":"10.1007\/s13675-020-00129-6_CR33","unstructured":"miplib2017 (2018) MIPLIB 2017, 2018. http:\/\/miplib.zib.de"},{"issue":"12","key":"10.1007\/s13675-020-00129-6_CR34","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1016\/0098-1354(94)00123-5","article-title":"Global optimization of bilinear process networks with multicomponent flows","volume":"19","author":"Quesada","year":"1995","journal-title":"Comput Chem Eng"},{"key":"10.1007\/s13675-020-00129-6_CR35","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","article-title":"Preprocessing and probing techniques for mixed integer programming problems","volume":"6","author":"Savelsbergh","year":"1994","journal-title":"ORSA J Comput"},{"key":"10.1007\/s13675-020-00129-6_CR36","doi-asserted-by":"crossref","DOI":"10.1016\/j.orl.2020.02.006","article-title":"A decomposition heuristic for mixed-integer supply chain problems","author":"Schewe","year":"2020","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13675-020-00129-6_CR37","series-title":"Theory of linear and integer programming","author":"Schrijver","year":"1986"},{"key":"10.1007\/s13675-020-00129-6_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008241411395","article-title":"A finite algorithm for global minimization of separable concave programs","volume":"12","author":"Shectman","year":"1998","journal-title":"J Glob Optim"},{"issue":"3","key":"10.1007\/s13675-020-00129-6_CR39","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1287\/opre.27.3.503","article-title":"The multiple-choice knapsack problem","volume":"27","author":"Sinha","year":"1979","journal-title":"Oper Res"},{"issue":"4","key":"10.1007\/s13675-020-00129-6_CR40","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01299207","article-title":"Supernode processing of mixed-integer models","volume":"3","author":"Suhl","year":"1994","journal-title":"Comput Optim Appl"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-020-00129-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-020-00129-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-020-00129-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:47:24Z","timestamp":1761882444000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":40,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["S2192440621001283"],"URL":"https:\/\/doi.org\/10.1007\/s13675-020-00129-6","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2020,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Two-row and two-column mixed-integer presolve using hashing-based pairing methods","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-020-00129-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2020 The Author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd","name":"copyright","label":"Copyright"}]}}