{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:15:13Z","timestamp":1761621313794,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T00:00:00Z","timestamp":1492560000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10107-017-1147-2","type":"journal-article","created":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T08:57:04Z","timestamp":1492592224000},"page":"565-584","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix"],"prefix":"10.1007","volume":"169","author":[{"given":"J\u00f6rg","family":"Bader","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2730-0084","authenticated-orcid":false,"given":"Robert","family":"Hildebrand","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[]},{"given":"Rico","family":"Zenklusen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,19]]},"reference":[{"issue":"1\u20133","key":"1147_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discrete Appl. Math."},{"key":"1147_CR2","unstructured":"Baum, S., Trotter, L.E.: Optimization and operations research. In: Proceedings of a Workshop Held at the University of Bonn, October 2\u20138, 1977, chapter Integer rounding and polyhedral decomposition for totally unimodular systems, pp. 15\u201323. Springer Berlin Heidelberg, (1978)"},{"key":"1147_CR3","first-page":"1","volume-title":"Tutorials on Emerging Methodologies and Applications in Operations Research","author":"RD Carr","year":"2004","unstructured":"Carr, R.D., Konjevod, G.: Polyhedral combinatorics. In: Greenberg, H. (ed.) Tutorials on Emerging Methodologies and Applications in Operations Research, pp. 1\u201348. Springer, Berlin (2004)"},{"issue":"19\u201320","key":"1147_CR4","doi-asserted-by":"crossref","first-page":"2411","DOI":"10.1016\/j.disc.2005.12.033","volume":"306","author":"M Conforti","year":"2006","unstructured":"Conforti, M., Cornu\u00e9jols, G., Vu\u0161kovi\u0107, K.: Balanced matrices. Discrete Math. 306(19\u201320), 2411\u20132437 (2006)","journal-title":"Discrete Math."},{"issue":"1","key":"1147_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0095-8956(86)90065-1","volume":"40","author":"L Eggan","year":"1986","unstructured":"Eggan, L., Plantholt, M.: The chromatic index of nearly bipartite multigraphs. J. Comb. Theory Ser. B 40(1), 71\u201380 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"1147_CR6","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1137\/S089548010343569X","volume":"19","author":"D Gijswijt","year":"2005","unstructured":"Gijswijt, D.: Integer decomposition for polyhedra defined by nearly totally unimodular matrices. SIAM J. Discrete Math. 19(3), 798\u2013806 (2005)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1147_CR7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1137\/S0097539703426775","volume":"33","author":"R Hassin","year":"2004","unstructured":"Hassin, R., Levin, A.: An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM J. Comput. 33(2), 261\u2013268 (2004)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1147_CR8","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.2140\/pjm.1957.7.1351","volume":"7","author":"I Heller","year":"1957","unstructured":"Heller, I.: On linear systems with integral valued solutions. Pac. J. Math. 7(3), 1351\u20131364 (1957)","journal-title":"Pac. J. Math."},{"key":"1147_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1017\/S1446788713000529","volume":"96","author":"T Hibi","year":"2014","unstructured":"Hibi, T., Higashitani, A., Katth\u00e4n, L., Okazaki, R.: Normal cyclic polytopes and cyclic polytopes that are not very ample. J. Aust. Math. Soc. 96, 61\u201377 (2014)","journal-title":"J. Aust. Math. Soc."},{"issue":"2","key":"1147_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0012-365X(75)90003-5","volume":"11","author":"R Jeroslow","year":"1975","unstructured":"Jeroslow, R.: On defining sets of vertices of the hypercube by linear inequalities. Discrete Math. 11(2), 119\u2013124 (1975)","journal-title":"Discrete Math."},{"key":"1147_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-642-38189-8_4","volume-title":"Facets of Combinatorial Optimization - Festschrift for Martin Gr\u00f6tschel","author":"V Kaibel","year":"2013","unstructured":"Kaibel, V., Pashkovich, K.: Constructing extended formulations from reflection relations. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization - Festschrift for Martin Gr\u00f6tschel, pp. 77\u2013100. Springer, Berlin Heidelberg (2013)"},{"issue":"4","key":"1147_CR12","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/S0097539794263695","volume":"26","author":"AV Karzanov","year":"1997","unstructured":"Karzanov, A.V., McCormick, S.T.: Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM J. Comput. 26(4), 1245\u20131275 (1997)","journal-title":"SIAM J. Comput."},{"key":"1147_CR13","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2007","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Berlin (2007)","edition":"4"},{"key":"1147_CR14","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"1147_CR15","unstructured":"Lodi, A.: Personal communication, 2014 and 2015"},{"issue":"6","key":"1147_CR16","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.35.6.820","volume":"35","author":"RK Martin","year":"1987","unstructured":"Martin, R.K.: Generating alternative mixed-integer programming models using variable redefinition. Oper. Res. 35(6), 820\u2013831 (1987)","journal-title":"Oper. Res."},{"issue":"4","key":"1147_CR17","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.orl.2013.04.011","volume":"41","author":"G Oriolo","year":"2013","unstructured":"Oriolo, G., Sanit\u00e0, L., Zenklusen, R.: Network design with a discrete set of traffic matrices. Oper. Res. Lett. 41(4), 390\u2013396 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"1147_CR18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-6377(88)90024-7","volume":"7","author":"M Padberg","year":"1988","unstructured":"Padberg, M.: Total unimodularity and the Euler-subgraph problem. Oper. Res. Lett. 7(4), 173\u2013179 (1988)","journal-title":"Oper. Res. Lett."},{"key":"1147_CR19","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1986)"},{"issue":"3","key":"1147_CR20","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"PD Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of regular matroids. J. Comb. Theory Ser. B 28(3), 305\u2013359 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"1147_CR21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0095-8956(90)90030-4","volume":"49","author":"K Truemper","year":"1990","unstructured":"Truemper, K.: A decomposition theory for matroids. V. Testing of matrix total unimodularity. J. Comb. Theory Ser. B 49(2), 241\u2013281 (1990)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1147_CR22","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/978-3-540-68279-0_13","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"F Vanderbeck","year":"2010","unstructured":"Vanderbeck, F., Wolsey, L.A.: Reformulation and decomposition of integer programs. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 431\u2013502. Springer, Berlin (2010)"},{"key":"1147_CR23","unstructured":"Veselov, S.I., Gribanov, D.V.: On integer programming with almost unimodular matrices and the flatness theorem for simplices (2015). \n                        arXiv:1505.03132\n                        \n                     [cs.CG]"},{"issue":"6","key":"1147_CR24","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0020-0190(92)90226-L","volume":"42","author":"GJ Woeginger","year":"1992","unstructured":"Woeginger, G.J., Yu, Z.: On the equal-subset-sum problem. Inf. Process. Lett. 42(6), 299\u2013302 (1992)","journal-title":"Inf. Process. Lett."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1147-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1147-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1147-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,10]],"date-time":"2018-05-10T03:59:50Z","timestamp":1525924790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1147-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,19]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["1147"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1147-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2017,4,19]]}}}