{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T08:41:04Z","timestamp":1777538464685,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,7,23]],"date-time":"2008-07-23T00:00:00Z","timestamp":1216771200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10107-008-0236-7","type":"journal-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T11:11:43Z","timestamp":1216725103000},"page":"337-352","source":"Crossref","is-referenced-by-count":9,"title":["Lattice based extended formulations for integer linear equality systems"],"prefix":"10.1007","volume":"121","author":[{"given":"Karen","family":"Aardal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,23]]},"reference":[{"key":"236_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-Dawande instances. INFORMS J. Comput. 12, 192\u2013202 (2000)","journal-title":"INFORMS J. Comput."},{"key":"236_CR2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/moor.25.3.427.12219","volume":"25","author":"K. Aardal","year":"2000","unstructured":"Aardal K., Hurkens C.A.J., Lenstra A.K.: Solving a system of diophantine equations with lower and upper bounds on the variables. Math. Oper. Res. 25, 427\u2013442 (2000)","journal-title":"Math. Oper. Res."},{"key":"236_CR3","doi-asserted-by":"crossref","unstructured":"Aardal, K., Lenstra, A.K.: Hard equality constrained integer knapsacks. Mathematics of Operations Research, 29(3), 724\u2013738 (2004). Erratum: Mathematics of Operations Research, 31(4), p. 846 (2006)","DOI":"10.1287\/moor.1040.0099"},{"key":"236_CR4","doi-asserted-by":"crossref","unstructured":"Andersen, K., Pochet, Y.: Coefficient strengthening: a tool for formulating mixed integer programs. CORE DP 2007\/24, Universit\u00e9 catholique de Louvain (2007)","DOI":"10.2139\/ssrn.1006761"},{"key":"236_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(71)90005-7","volume":"1","author":"G.H. Bradley","year":"1971","unstructured":"Bradley G.H.: Transformation of integer programs to knapsack problems. Discrete Math. 1, 29\u201345 (1971)","journal-title":"Discrete Math."},{"key":"236_CR6","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1287\/mnsc.17.5.354","volume":"17","author":"G.H. Bradley","year":"1971","unstructured":"Bradley G.H.: Equivalent integer programs and canonical problems. Manage. Sci. 17, 354\u2013366 (1971)","journal-title":"Manage. Sci."},{"key":"236_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01585527","volume":"7","author":"G.H. Bradley","year":"1974","unstructured":"Bradley G.H., Hammer P.L., Wolsey L.A.: Coefficient reduction for inequalities in 0-1 variables. Math. Program. 7, 263\u2013282 (1974)","journal-title":"Math. Program."},{"key":"236_CR8","doi-asserted-by":"crossref","unstructured":"Cassels, J.W.S.: An Introduction to the Geometry of Numbers. Classics in Mathematics. Springer, Berlin (1997). Second Printing, Corrected, Reprint of the 1971 ed.","DOI":"10.1007\/978-3-642-62035-5_3"},{"key":"236_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/ijoc.11.2.205","volume":"11","author":"G. Cornu\u00e9jols","year":"1999","unstructured":"Cornu\u00e9jols G., Dawande M.: A class of hard small 0-1 programs. INFORMS J. Comput. 11, 205\u2013210 (1999)","journal-title":"INFORMS J. Comput."},{"key":"236_CR10","first-page":"92","volume-title":"Algorithms\u2013ESA \u201997. Lecture Notes in Computer Science, vol. 1284","author":"G. Cornu\u00e9jols","year":"1997","unstructured":"Cornu\u00e9jols G., Urbaniak R., Weismantel R., Wolsey L.A.: Decomposition of integer programs and of generating sets. In: Burkard, R.E., Woeginger, G.J.(eds) Algorithms\u2013ESA \u201997. Lecture Notes in Computer Science, vol. 1284, pp. 92\u2013103. Springer, Berlin (1997)"},{"key":"236_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1146\/annurev.cs.02.060187.001311","volume":"2","author":"R. Kannan","year":"1987","unstructured":"Kannan R.: Algorithmic geometry of numbers. Annu. Rev. Comput. Sci. 2, 231\u2013267 (1987)","journal-title":"Annu. Rev. Comput. Sci."},{"key":"236_CR12","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R. Kannan","year":"1979","unstructured":"Kannan R., Bachem A.: Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM J. Comput. 8, 499\u2013507 (1979)","journal-title":"SIAM J. Comput."},{"key":"236_CR13","unstructured":"Karamanov, M., Cornu\u00e9jols, G.: Branching on general disjunctions. Working paper, Tepper School of Business, Carnegie Mellon University (2005). Revised September 2007. To appear in: Chv\u00e1tal, V., Sbihi, N. (eds.) Proceedings of the Montreal 2006 NATO Conference"},{"key":"236_CR14","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W. Jr, Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"236_CR15","first-page":"37","volume-title":"Proceedings of the third European Congress of Mathematics, vol. I","author":"H.W. Lenstra Jr.","year":"2000","unstructured":"Lenstra H.W. Jr.: Flags and lattice basis reduction. In: Casacuberta, C., Mir\u00f3-Roig, R.M., Verdera, J., Xamb\u00f3-Descamps, S.(eds) Proceedings of the third European Congress of Mathematics, vol. I, pp. 37\u201351. Birkh\u00e4user Verlag, Basel (2000)"},{"key":"236_CR16","unstructured":"Lenstra, H.W. Jr.: Lattices. To appear in: Surveys in Algorithmic Number Theory, Mathematical Sciences Research Institute Publications, Cambridge University Press, Cambridge (2005)"},{"key":"236_CR17","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970203","volume-title":"An Algorithmic Theory of Numbers, Graphs and Convexity. CBMS-NSF Regional Conference Series in applied mathematics, vol. 50","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L.: An Algorithmic Theory of Numbers, Graphs and Convexity. CBMS-NSF Regional Conference Series in applied mathematics, vol. 50. SIAM, Philadelphia (1986)"},{"issue":"3","key":"236_CR18","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.27.3.470.315","volume":"27","author":"Q. Louveaux","year":"2002","unstructured":"Louveaux Q., Wolsey L.A.: Combining problem structure with basis reduction to solve a class of hard integer programs. Math. Oper. Res. 27(3), 470\u2013484 (2002)","journal-title":"Math. Oper. Res."},{"key":"236_CR19","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/opre.33.3.505","volume":"33","author":"R.K. Martin","year":"1985","unstructured":"Martin R.K., Schrage L.: Subset coefficient reduction cuts for 0-1 mixed integer programming. Oper. Res. 33, 505\u2013526 (1985)","journal-title":"Oper. Res."},{"key":"236_CR20","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1002\/nav.3800190410","volume":"19","author":"M.W. Padberg","year":"1972","unstructured":"Padberg M.W.: Equivalent knapsack-type formulations of bounded integer programs: an alternative approach. Naval Res. Log. Q. 19, 699\u2013708 (1972)","journal-title":"Naval Res. Log. Q."},{"key":"236_CR21","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"236_CR22","unstructured":"Xpress-MP Optimization Software. Dash optimization. http:\/\/www.dashoptimization.com\/home\/index.html"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0236-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0236-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0236-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T08:25:08Z","timestamp":1684484708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0236-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,23]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["236"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0236-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,23]]}}}