{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:32:55Z","timestamp":1772519575936,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":[[1992,3]]},"DOI":"10.1007\/bf01191202","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T11:10:38Z","timestamp":1108725038000},"page":"27-37","source":"Crossref","is-referenced-by-count":54,"title":["On integer points in polyhedra"],"prefix":"10.1007","volume":"12","author":[{"given":"W.","family":"Cook","sequence":"first","affiliation":[]},{"given":"M.","family":"Hartmann","sequence":"additional","affiliation":[]},{"given":"R.","family":"Kannan","sequence":"additional","affiliation":[]},{"given":"C.","family":"McDiarmid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"I. B\ufffdr\ufffdny, R. Howe, andL. Lov\ufffdsz: On integer points in polyhedra: a lower bound, Cowles Foundation Discussion Paper No. 917, Cowles Foundation for Research in Economics, Yale University, 1989."},{"key":"CR2","volume-title":"An Introduction to the Geometry of Numbers","author":"J. W. S. Cassels","year":"1971","unstructured":"J. W. S. Cassels:An Introduction to the Geometry of Numbers (Springer-Verlag, Berlin, 1971)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/322139.322141","volume":"26","author":"J. Cohen","year":"1979","unstructured":"J. Cohen, andT. Hickey: Two algorithms for determining volumes of convex polyhedra,Journal of the Association for Computing Machinery,26 (1979), 401?414.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR4","unstructured":"M. Dyer: On counting lattice points in polyhedra, submitted toSIAM Journal on Computing."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"M. Dyer, A. Frieze, andR. Kannan: A random polynomial time algorthm for approximating the volume of convex bodies, Research Report No. 88-40, Department of Mathematics, Carnegie-Mellon University, 1989.","DOI":"10.1145\/73007.73043"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579233","volume":"2","author":"J. Edmonds","year":"1982","unstructured":"J. Edmonds, L. Lov\ufffdsz, andW. R. Pulleyblank: Brick decompositions and the matching rank of graphs,Combinatorica 2 (1982), 247?274.","journal-title":"Combinatorica"},{"key":"CR7","volume-title":"Computers and Intractability, a Guide to the Theory of NP-completeness","author":"M. R. Gary","year":"1979","unstructured":"M. R. Gary, andD. S. Johnson:Computers and Intractability, a Guide to the Theory of NP-completeness (W. H. Freeman and Co., San Francisco, 1979)."},{"key":"CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\ufffdtschel","year":"1988","unstructured":"M. Gr\ufffdtschel, L. Lov\ufffdsz, andA. Schrijver:Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Heidelberg, 1988."},{"key":"CR9","volume-title":"Geometry of Numbers","author":"P. M. Gruber","year":"1987","unstructured":"P. M. Gruber, andC. G. Lekkerkerker:Geometry of Numbers, (Second edition) North Holland, Amsterdam, 1987.","edition":"Second edition"},{"key":"CR10","unstructured":"M. Hartmann: Cutting planes and the complexity of the integer hull, Technical Report No. 819, School of Operations Research and Industrial Engineering, Cornell University, 1989."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0166-218X(83)90067-7","volume":"6","author":"A. C. Hayes","year":"1983","unstructured":"A. C. Hayes, andD. G. Larman: The vertices of the knapsack polytope,Discrete Applied Math. 6 (1983), 135?138.","journal-title":"Discrete Applied Math."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"R. Kannan: Minkowski's convex body theorem and integer programming,Math. of Operations Research 12 (1987), 415?440.","journal-title":"Math. of Operations Research"},{"key":"CR13","volume-title":"Geometry of Numbers","author":"C. G. Lekkerkerker","year":"1969","unstructured":"C. G. Lekkerkerker:Geometry of Numbers, North Holland, Amsterdam, 1969."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. W. Lenstra Jr.","year":"1983","unstructured":"H. W. Lenstra, Jr.: Integer Programming in a fixed number of variables,Math. of Operations Research 8 (1983) 538?548.","journal-title":"Math. of Operations Research"},{"key":"CR15","unstructured":"L. Lov\ufffdsz: communicated by H.E. Scarf."},{"key":"CR16","volume-title":"Convex Polytopes and the Upper Bound Conjecture","author":"P. McMullen","year":"1971","unstructured":"P. McMullen, andG. C. Shephard:Convex Polytopes and the Upper Bound Conjecture, Cambridge University Press, Cambridge, 1971."},{"key":"CR17","unstructured":"D. Morgan: The set of vertices of the convex hull of integer points in regions defined by particular linear inequalities, submitted toMathematika."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1287\/opre.18.5.940","volume":"18","author":"D. S. Rubin","year":"1970","unstructured":"D. S. Rubin: On the unlimited number of faces in integer hulls of linear programs with a single constraint,Operations Research,18 (1970), 940?946.","journal-title":"Operations Research"},{"key":"CR19","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver:Theory of Linear and Integer Programming, Wiley, Chichester, 1986."},{"key":"CR20","first-page":"133","volume":"2","author":"V. N. Shevchenko","year":"1981","unstructured":"V. N. Shevchenko: On the number of extreme points in integer programming,Kibernetika (1981) No. 2, 133?134.","journal-title":"Kibernetika"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"L. G. Valiant: The complexity of enumeration and reliability problems,SIAM Journal on Computing 8 (1979) 410?421.","journal-title":"SIAM Journal on Computing"},{"key":"CR22","first-page":"13","volume":"4","author":"L. Zamansky","year":"1983","unstructured":"L. Zamansky, andV. Cherkassky: Determination of the number of integer points in polyhedra inR 3: polynomial algorithms,Doklady Akad. Nauk. Ukrain. USSR Ser. A (1983) No. 4, 13?15.","journal-title":"Doklady Akad. Nauk. Ukrain. USSR Ser. A"},{"issue":"No. 6","key":"CR23","first-page":"1132","volume":"20","author":"L. Zamansky","year":"1984","unstructured":"L. Zamansky, andV. Cherkassky: The formula for finding the number of integer points under a line and its application,Ekonomika i Mat. Metody 20 (1984) No. 6, 1132?1138.","journal-title":"Ekonomika i Mat. Metody"},{"key":"CR24","volume-title":"Effective algorithms for the solution of discrete optimization problems","author":"L. Zamansky","year":"1984","unstructured":"L. Zamansky, andV. Cherkassky:Effective algorithms for the solution of discrete optimization problems, Kiev: Znanie, 1984."},{"key":"CR25","first-page":"11","volume":"10","author":"L. Zamansky","year":"1985","unstructured":"L. Zamansky, andV. Cherkassky: Generalization of the Jacobi-Perron algorithm for determining the number of integer points in polyhedra,Doklady Akad. Nauk. Ukrain. USSR Ser. A (1985) No. 10, 11?13.","journal-title":"Doklady Akad. Nauk. Ukrain. USSR Ser. A"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191202.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01191202\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T06:38:54Z","timestamp":1683009534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01191202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["BF01191202"],"URL":"https:\/\/doi.org\/10.1007\/bf01191202","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}