{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T16:54:29Z","timestamp":1680454469417},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T00:00:00Z","timestamp":1330214400000},"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":[[2013,10]]},"DOI":"10.1007\/s10107-012-0518-y","type":"journal-article","created":{"date-parts":[[2012,2,24]],"date-time":"2012-02-24T23:18:02Z","timestamp":1330125482000},"page":"257-271","source":"Crossref","is-referenced-by-count":5,"title":["Testing additive integrality gaps"],"prefix":"10.1007","volume":"141","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolai","family":"H\u00e4hnle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gennady","family":"Shmonin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,26]]},"reference":[{"issue":"4","key":"518_CR1","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0602044","volume":"2","author":"S.P. Baum","year":"1981","unstructured":"Baum S.P., Trotter L.E. Jr: Integer rounding for polymatroid and branching optimization problems. SIAM J. Algebraic Discret. Methods 2(4), 416\u2013425 (1981)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"518_CR2","doi-asserted-by":"crossref","unstructured":"Cook, W.J., Lov\u00e1sz L., Schrijver, A.: A polynomial-time test for total dual integrality in fixed dimension. In: Korte, B.H., Ritter, K. (eds.) Mathematical Programming at Oberwolfach II, vol. 22 of Mathematical Programming Study, pp. 64\u201369. North-Holland, Amsterdam (1984)","DOI":"10.1007\/BFb0121008"},{"issue":"2","key":"518_CR3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-007-0103-y","volume":"114","author":"G. Ding","year":"2008","unstructured":"Ding G., Feng L., Zang W.: The complexity of recognizing linear systems with certain integrality properties. Math. Program. 114(2), 321\u2013334 (2008)","journal-title":"Math. Program."},{"issue":"4","key":"518_CR4","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1287\/moor.1080.0320","volume":"33","author":"F. Eisenbrand","year":"2008","unstructured":"Eisenbrand F., Shmonin G.: Parametric integer programming in fixed dimension. Math. Oper. Res. 33(4), 839\u2013850 (2008)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"518_CR5","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. Discret. Math. 19(3), 798\u2013806 (2005)","journal-title":"SIAM J. Discret. Math."},{"key":"518_CR6","unstructured":"Giles, F.R., Orlin, J.B.: Verifying total dual integrality. Manuscript (1981)"},{"issue":"3","key":"518_CR7","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s00493-007-2057-3","volume":"27","author":"S. Ho\u015ften","year":"2007","unstructured":"Ho\u015ften S., Sturmfels B.: Computing the integer programming gap. Combinatorica 27(3), 367\u2013382 (2007)","journal-title":"Combinatorica"},{"key":"518_CR8","first-page":"223","volume-title":"Linear Inequalities and Related Systems, vol. 38 of Annals of Mathematics Studies","author":"A.J. Hoffman","year":"1956","unstructured":"Hoffman A.J., Kruskal J.B.: Integral boundary points of convex polyhedra. In: Kuhn, H.W., Tucker, A.W. (eds) Linear Inequalities and Related Systems, vol. 38 of Annals of Mathematics Studies, pp. 223\u2013246. Princeton University Press, Princeton, NJ (1956)"},{"key":"518_CR9","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Test sets for integer programs, $${\\forall \\, \\exists}$$ sentences. In: Cook, W.J., Seymour, P.D. (eds.) Polyhedral Combinatorics: Proceedings of a DIMACS Workshop held at the Center for Discrete Mathematics and Theoretical Computer Science, 12\u201316 June 1989, vol. 1 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science American Mathematical Society, pp. 39\u201347 (1990)","DOI":"10.1090\/dimacs\/001\/05"},{"issue":"2","key":"518_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01204720","volume":"12","author":"R. Kannan","year":"1992","unstructured":"Kannan R.: Lattice translates of a polytope and the Frobenius problem. Combinatorica 12(2), 161\u2013177 (1992)","journal-title":"Combinatorica"},{"issue":"4","key":"518_CR11","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr","year":"1983","unstructured":"Lenstra H.W. Jr: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"518_CR12","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry, vol. 212 of Graduate Texts in Mathematics, Springer, Berlin (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"issue":"1\u20132, Ser. A","key":"518_CR13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10107-009-0294-5","volume":"128","author":"J. Pap","year":"2011","unstructured":"Pap J.: Recognizing conic TDI systems is hard. Math. Program. 128(1\u20132, Ser. A), 43\u201348 (2011)","journal-title":"Math. Program."},{"issue":"4","key":"518_CR14","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"C.H. Papadimitriou","year":"1981","unstructured":"Papadimitriou C.H.: On the complexity of integer programming. J. ACM 28(4), 765\u2013768 (1981)","journal-title":"J. ACM"},{"issue":"1","key":"518_CR15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01300131","volume":"16","author":"J.L. Ram\u00edrez Alfons\u00edn","year":"1996","unstructured":"Ram\u00edrez Alfons\u00edn J.L.: Complexity of the Frobenius problem. Combinatorica 16(1), 143\u2013147 (1996)","journal-title":"Combinatorica"},{"key":"518_CR16","volume-title":"Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, West Sussex (1986)"},{"key":"518_CR17","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24 of Algorithms and Combinatorics. Springer, Berlin (2003)"},{"issue":"3","key":"518_CR18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P.D. 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":"3","key":"518_CR19","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1137\/0402036","volume":"2","author":"S.K. Tipnis","year":"1989","unstructured":"Tipnis S.K., Trotter L.E. Jr: Node-packing problems with integer rounding properties. SIAM J. Discret. Math. 2(3), 407\u2013412 (1989)","journal-title":"SIAM J. Discret. Math."},{"key":"518_CR20","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani V.V.: Approximation Algorithms. Springer, Berlin (2001)"},{"issue":"3","key":"518_CR21","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1137\/1010063","volume":"10","author":"A.F. Veinott Jr","year":"1968","unstructured":"Veinott A.F. Jr, Dantzig G.B.: Integral extreme points. SIAM Rev. 10(3), 371\u2013372 (1968)","journal-title":"SIAM Rev."},{"issue":"3","key":"518_CR22","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.orl.2006.06.006","volume":"35","author":"G. Zambelli","year":"2007","unstructured":"Zambelli G.: Colorings of k-balanced matrices and integer decomposition property of related polyhedra. Oper. Res. Lett. 35(3), 353\u2013356 (2007)","journal-title":"Oper. Res. Lett."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0518-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0518-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0518-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T04:12:25Z","timestamp":1561349545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0518-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,26]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["518"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0518-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,26]]}}}