{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:34:38Z","timestamp":1772516078638,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T00:00:00Z","timestamp":1462838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s00493-015-3266-9","type":"journal-article","created":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T01:43:52Z","timestamp":1462844632000},"page":"313-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A quantitative Doignon-Bell-Scarf theorem"],"prefix":"10.1007","volume":"37","author":[{"given":"Iskander","family":"Aliev","sequence":"first","affiliation":[]},{"given":"Robert","family":"Bassett","sequence":"additional","affiliation":[]},{"given":"Jes\u00fas A.","family":"De Loera","sequence":"additional","affiliation":[]},{"given":"Quentin","family":"Louveaux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,10]]},"reference":[{"key":"3266_CR1","volume-title":"Proceedings of Integer Programming and Combinatorial Optimization, 17th International IPCO Conference, Bonn Germany, June","author":"I. Aliev","year":"2014","unstructured":"I. Aliev, J. A. De Loera and Q. Louveaux: Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf\u2019s Theorem, in: Proceedings of Integer Programming and Combinatorial Optimization, 17th International IPCO Conference, Bonn Germany, June, 2014."},{"key":"3266_CR2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02574379","volume":"12","author":"N. Amenta","year":"1994","unstructured":"N. Amenta: Helly-type theorems and generalized linear programming, Discrete and Computational Geometry 12 (1994), 241\u2013261.","journal-title":"Discrete and Computational Geometry"},{"key":"3266_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1515\/advgeom.2011.028","volume":"12","author":"G. Averkov","year":"2012","unstructured":"G. Averkov and R. Weismantel: Transversal numbers over subsets of linear spaces, Adv. Geom. 12 (2012), 19\u201328.","journal-title":"Adv. Geom."},{"key":"3266_CR4","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1016\/j.orl.2008.08.003","volume":"36","author":"K. Andersen","year":"2008","unstructured":"K. Andersen, Q. Louveaux and R. Weismantel: Certificates of linear mixed integer infeasibility, Operations Research Letters 36 (2008), 734\u2013738.","journal-title":"Operations Research Letters"},{"key":"3266_CR5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.1090.0439","volume":"35","author":"K. Andersen","year":"2010","unstructured":"K. Andersen, Q. Louveaux and R. Weismantel: An analysis of mixed integer linear sets based on lattice point free convex sets, Math of Operations Research 35 (2010), 233\u2013256.","journal-title":"Math of Operations Research"},{"key":"3266_CR6","volume-title":"Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27","author":"K. Andersen","year":"2007","unstructured":"K. Andersen, Q. Louveaux, R. Weismantel and L. Wolsey: Inequalities from two rows of the simplex tableau, in: M. Fischetti & D. P., Williamson (Eds.) Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, Lecture Notes in Computer Science 4513, 1-15."},{"key":"3266_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.2307\/2044407","volume":"86","author":"I. B\u00e1r\u00e1ny","year":"1982","unstructured":"I. B\u00e1r\u00e1ny, M. Katchalski and J. Pach: Quantitative Helly-type theorems, Proc. Amer. Math. Soc. 86 (1982), 109\u2013114.","journal-title":"Proc. Amer. Math. Soc."},{"key":"3266_CR8","doi-asserted-by":"crossref","first-page":"362","DOI":"10.2307\/2322144","volume":"91","author":"I. B\u00e1r\u00e1ny","year":"1984","unstructured":"I. B\u00e1r\u00e1ny, M. Katchalski and J. Pach: Helly\u2019s theorem with volumes, Amer. Math. Monthly 91 (1984), 362\u2013365.","journal-title":"Amer. Math. Monthly"},{"key":"3266_CR9","first-page":"91","volume-title":"New perspectives in algebraic combinatorics, Math. Sci. res. Inst. Publ.","author":"A. Barvinok","year":"1999","unstructured":"A. Barvinok and J. Pommersheim: An algorithmic theory of lattice points in polyhedra, New perspectives in algebraic combinatorics, Math. Sci. res. Inst. Publ., 38, Cambridge Univ. Press, Cambridge, (1999), 91\u2013147.","edition":"38"},{"key":"3266_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/sapm1977562187","volume":"56","author":"D. E. Bell","year":"1977","unstructured":"D. E. Bell: A theorem concerning the integer lattice, Studies in Applied Mathematics 56 (1977), 187\u2013188.","journal-title":"Studies in Applied Mathematics"},{"key":"3266_CR11","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.1080.0370","volume":"34","author":"V. Borozan","year":"2009","unstructured":"V. Borozan and G. Cornu\u00e9jols: Minimal valid inequalities for integer constraints, Math. Oper. Res. 34 (2009), 538\u2013546.","journal-title":"Math. Oper. Res."},{"key":"3266_CR12","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"K. L. Clarkson","year":"1995","unstructured":"K. L. Clarkson: Las Vegas algorithms for linear and integer programming when the dimension is small, Journal of the ACM 42 (1995), 488\u2013499.","journal-title":"Journal of the ACM"},{"key":"3266_CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.sorms.2011.03.001","volume":"16","author":"M. Conforti","year":"2011","unstructured":"M. Conforti, G. Cornu\u00e9jols and G. Zambelli: Corner polyhedron and intersection cuts, Surveys in Operations Research and Management Science 16 (2011), 105\u2013120.","journal-title":"Surveys in Operations Research and Management Science"},{"key":"3266_CR14","doi-asserted-by":"crossref","unstructured":"L. Danzer, B. Gr\u00fcnbaum and V. Klee: Helly\u2019s theorem and its relatives, in: 1963 Proc. Sympos. Pure Math., Vol. VII pp. 101-180 Amer. Math. Soc., Providence, R.I.","DOI":"10.1090\/pspum\/007\/0157289"},{"key":"3266_CR15","volume-title":"MOS-SIAM Series on Optimization, 14. Society for Industrial and Applied Mathematics (SIAM)","author":"J. A. D. Loera","year":"2013","unstructured":"J. A. De Loera, R. Hemmecke and M. K\u00f6ppe: Algebraic and geometric ideas in the theory of discrete optimization, MOS-SIAM Series on Optimization, 14. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA; Mathematical Optimization Society, Philadelphia, PA, 2013."},{"key":"3266_CR16","doi-asserted-by":"crossref","first-page":"2890","DOI":"10.1137\/090754388","volume":"20","author":"S. Dey","year":"2010","unstructured":"S. Dey and L. Wolsey: Constrained infinite group relaxations of MIPs, SIAM J. Optim. 20 (2010), 2890\u20132912.","journal-title":"SIAM J. Optim."},{"key":"3266_CR17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01949705","volume":"3","author":"J.-P. Doignon","year":"1973","unstructured":"J-P. Doignon: Convexity in cristallographical lattices, Journal of Geometry 3 (1973), 71\u201385.","journal-title":"Journal of Geometry"},{"key":"3266_CR18","volume-title":"Handbook of convex geometry","author":"J. Eckhoff","year":"1993","unstructured":"J. Eckhoff: Helly, Radon, and Carath\u00e9odory type theorems, in: Handbook of convex geometry, Vol. A, B, 389-448, North-Holland, Amsterdam, 1993."},{"key":"3266_CR19","first-page":"196","volume-title":"Algorithms-ESA","author":"F. Eisenbrand","year":"2003","unstructured":"F. Eisenbrand: Fast integer programming in fixed dimension, Algorithms-ESA (2003), 196\u2013207."},{"key":"3266_CR20","doi-asserted-by":"crossref","first-page":"2124","DOI":"10.1016\/j.dam.2007.08.048","volume":"156","author":"B. G\u00e4rtner","year":"2008","unstructured":"B. G\u00e4rtner, J. Matou\u0161ek, L. R\u00fcst and P \u0160kovro\u0148: Violator spaces: structure and algorithms, Discrete Applied Mathematics 156 (2008), 2124\u20132141.","journal-title":"Discrete Applied Mathematics"},{"key":"3266_CR21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02022039","volume":"4","author":"H. W. Hamacher","year":"1985","unstructured":"H. W. Hamacher and M. Queyranne: K best solutions to combinatorial optimization problems, Ann. Oper. Res. 4 (1985), 123\u2013143.","journal-title":"Ann. Oper. Res."},{"key":"3266_CR22","first-page":"284","volume-title":"Proceedings of Second International Conference on Combinatorial Mathematics","author":"A.J. Hoffman","year":"1978","unstructured":"A.J. Hoffman: Binding constraints and Helly numbers, in: Proceedings of Second International Conference on Combinatorial Mathematics (New York, 1978), 284\u2013288, Ann. New York Acad. Sci., 319, New York Acad. Sci., New York, 1979."},{"key":"3266_CR23","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.4153\/CJM-1991-058-4","volume":"43","author":"J. C. Lagarias","year":"1991","unstructured":"J. C. Lagarias and G. M. Ziegler: Bounds for lattice polytopes containing a fixed number of interior points in a sublattice, Canad. J. Math. 43 (1991), 1022\u20131035.","journal-title":"Canad. J. Math."},{"key":"3266_CR24","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E. L. Lawler","year":"1971","unstructured":"E. L. Lawler: A procedure for computing the K-best solutions to discrete optimization problems and its application to the shortest path problem, Management Sci. 18 (1971\/72), 401\u2013405.","journal-title":"Management Sci."},{"key":"3266_CR25","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1112\/S0025579300014339","volume":"48","author":"O. Pikhurko","year":"2003","unstructured":"O. Pikhurko: Lattice points in lattice polytopes, Mathematika 48 (2003), 15\u201324.","journal-title":"Mathematika"},{"issue":"9","key":"3266_CR26","doi-asserted-by":"crossref","first-page":"3637","DOI":"10.1073\/pnas.74.9.3637","volume":"74","author":"H. E. Scarf","year":"1977","unstructured":"H. E. Scarf: An observation on the structure of production sets with indivisibilities, Proceedings of the National Academy of Sciences 74.9 (1977), 3637\u20133641.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"3266_CR27","volume-title":"Theory of linear and integer programming, Wiley-Interscience Series in Discrete Mathematics A Wiley-Interscience Publication","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver: Theory of linear and integer programming, Wiley-Interscience Series in Discrete Mathematics A Wiley-Interscience Publication. John Wiley & Sons, Ltd., Chichester, 1986."},{"key":"3266_CR28","first-page":"567","volume-title":"Proceedings of 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science","author":"M. Sharir","year":"1992","unstructured":"M. Sharir and E. Welzl: A combinatorial bound for linear programming and related problems, in: Proceedings of 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 577, Springer-Verlag, (1992), 567\u2013579."},{"key":"3266_CR29","volume-title":"Handbook of discrete and computational geometry, Handbook of discrete and computational geometry","author":"R. Wenger","year":"2004","unstructured":"R. Wenger: Helly-type theorems and geometric transversals, in: Handbook of discrete and computational geometry, Handbook of discrete and computational geometry. Second edition. Edited by Jacob E. Goodman and Joseph O\u2019Rourke. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall\/CRC, Boca Raton, FL, 2004.","edition":"Second"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-3266-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3266-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3266-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3266-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T21:55:50Z","timestamp":1655762150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-3266-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,10]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["3266"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-3266-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,10]]}}}