{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:15:14Z","timestamp":1780672514133,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2007,5]]},"DOI":"10.1007\/s00493-007-2057-3","type":"journal-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T05:17:24Z","timestamp":1211951844000},"page":"367-382","source":"Crossref","is-referenced-by-count":22,"title":["Computing the integer programming gap"],"prefix":"10.1007","volume":"27","author":[{"given":"Serkan","family":"Ho\u015ften","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd","family":"Sturmfels","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,5,29]]},"reference":[{"key":"2057_CR1","first-page":"131","volume-title":"Statistical Data Protection Proceedings","author":"L. Buzzigoli","year":"1999","unstructured":"L. Buzzigoli and A. Gusti: An algorithm to calculate the lower and upper bounds of the elements of an array given its marginals, in Statistical Data Protection Proceedings, Eurostat, Luxembourg (1999), pp. 131\u2013147."},{"key":"2057_CR2","first-page":"91","volume":"38","author":"A. Barvinok","year":"1999","unstructured":"A. Barvinok and J. E. Pommerscheim: A algorithmic theory of lattice points in polyhedra, in New Perspectives in Algebraic Combinatorics, MSRI Publications 38 (1999), pp. 91\u2013147.","journal-title":"New Perspectives in Algebraic Combinatorics"},{"key":"2057_CR3","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1090\/S0894-0347-03-00428-4","volume":"16","author":"A. Barvinok","year":"2003","unstructured":"A. Barvinok and K. Woods: Short rational generating functions for lattice point problems, Journal of the American Math. Soc. 16 (2003), 957\u2013979.","journal-title":"Journal of the American Math. Soc."},{"key":"2057_CR4","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6911-1","volume-title":"Using Algebraic Geometry","author":"D. Cox","year":"1998","unstructured":"D. Cox, J. Little and D. O\u2019shea: Using Algebraic Geometry, Graduate Texts in Mathematics 185, Springer-Verlag, New York, 1998."},{"key":"2057_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02216926","volume":"20","author":"L. Cox","year":"1989","unstructured":"L. Cox and J. George: Controlled rounding for tables with subtotals, Annals of Operations Research 20 (1989), 141\u2013157.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"2057_CR6","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"J. A. Loera De","year":"2004","unstructured":"J. A. De Loera, R. Hemmecke, J. Tauzer and R. Yoshida: Effective lattice point counting in rational convex polytopes, Symbolic Computation 38(4) (2004), 1273\u20131302.","journal-title":"Symbolic Computation"},{"key":"2057_CR7","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s00026-003-0196-9","volume":"7","author":"M. Develin","year":"2003","unstructured":"M. Develin and S. Sullivant: Markov bases of binary graph models, Annals of Combinatorics 7 (2003), 441\u2013466; math.CO\/0308280.","journal-title":"Annals of Combinatorics"},{"key":"2057_CR8","doi-asserted-by":"crossref","first-page":"11885","DOI":"10.1073\/pnas.97.22.11885","volume":"97","author":"A. Dobra","year":"2000","unstructured":"A. Dobra and S. Fienberg: Bounds for cell entries in contingency tables given marginal totals and decomposable graphs, Proc. Natl. Acad. Sci. USA 97 (2000), 11885\u201311892.","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2057_CR9","volume-title":"Mathematical Computations with Macaulay2, Algorithms and Computation in Mathematics","author":"D. Eiesenbud","year":"2001","unstructured":"D. Eiesenbud, D. Grayson, M. Stillman and B. Sturmfels: Mathematical Computations with Macaulay2, Algorithms and Computation in Mathematics, Vol. 8, Springer-Verlag, Heidelberg, 2001."},{"key":"2057_CR10","doi-asserted-by":"crossref","unstructured":"S. Ho\u015ften and S. Sullivant: Gr\u00f6bner bases and polyhedral geometry of reducible and cyclic models, J. Combinatorial Theory, Ser. A 100 277\u2013301.","DOI":"10.1006\/jcta.2002.3301"},{"key":"2057_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0022-4049(99)00009-2","volume":"139","author":"S. Ho\u015ften","year":"1999","unstructured":"S. Ho\u015ften and R. Thomas: Standard pairs and group relaxations in integer programming, J. Pure Appl. Algebra 139 (1999), 133\u2013157.","journal-title":"J. Pure Appl. Algebra"},{"key":"2057_CR12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.4310\/MRL.1999.v6.n1.a6","volume":"6","author":"S. Ho\u015ften","year":"1999","unstructured":"S. Ho\u015ften and R. Thomas: The associated primes of initial ideals of lattice ideals, Math. Res. Lett. 6 (1999), 83\u201397.","journal-title":"Math. Res. Lett."},{"key":"2057_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1080\/10586458.2000.10504409","volume":"9","author":"B. Huber","year":"2000","unstructured":"B. Huber and R. Hhomas: Computing Gr\u00f6bner fans of toric ideals, Experimental Mathematics 9 (2000), 321\u2013331.","journal-title":"Experimental Mathematics"},{"key":"2057_CR14","unstructured":"A. Jensen: CaTS \u2014 A computer program for computing the Gr\u00f6bner fan of a toric ideal, http:\/\/www.soopadoopa.dk\/anders\/cats\/cats.html ."},{"key":"2057_CR15","unstructured":"J. B. Lasserre: Duality and a Farkas lemma for integer programs, in Optimization: Structure and Applications (E. Hunt and C. E. M. Pearce, editors), Applied Optimization Series, Kluwer Academic Publishers, 2003."},{"key":"2057_CR16","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04112-3","volume-title":"Gr\u00f6bner Deformations of Hypergeometric Differential Equations","author":"M. Saito","year":"2000","unstructured":"M. Saito, B. Sturmfels and N. Takayama: Gr\u00f6bner Deformations of Hypergeometric Differential Equations, Algorithms and Computation in Mathematics 6, Springer-Verlag, Berlin, 2000."},{"key":"2057_CR17","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver: Theory of Linear and Integer Programming, Wiley Interscience, Chichester, 1986."},{"key":"2057_CR18","doi-asserted-by":"crossref","unstructured":"B. Sturmfels: Gr\u00f6bner Bases and Convex Polytopes, University Lecture Series 8, American Mathematical Society, 1995.","DOI":"10.1090\/ulect\/008"},{"key":"2057_CR19","first-page":"357","volume":"77","author":"B. Sturmfels","year":"1997","unstructured":"B. Sturmfels and R. Thomas: Variation of cost functions in integer programming, Mathematical Programming 77 (1997), 357\u2013387.","journal-title":"Mathematical Programming"},{"key":"2057_CR20","first-page":"281","volume":"36","author":"B. Sturmfels","year":"1995","unstructured":"B. Sturmfels, R. Weismantel and G. Ziegler: Gr\u00f6bner bases of lattices, corner polyhedra, and integer programming; Beitr\u00e4ge zur Algebra und Geometrie 36 (1995), 281\u2013298.","journal-title":"Beitr\u00e4ge zur Algebra und Geometrie"},{"key":"2057_CR21","unstructured":"R. R. Thomas: The structure of group relaxations, to appear in Handbook of Discrete Optimization (eds.: K. Aardal, G. Nemhauser, R. Weismantel), 2003, http:\/\/www.math.washington.edu\/~thomas\/articles.html ."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2057-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-007-2057-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2057-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:45Z","timestamp":1559093565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-007-2057-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["2057"],"URL":"https:\/\/doi.org\/10.1007\/s00493-007-2057-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5]]}}}