{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:57:04Z","timestamp":1725562624683},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221135"},{"type":"electronic","value":"9783540259602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25960-2_19","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T23:21:46Z","timestamp":1281309706000},"page":"244-255","source":"Crossref","is-referenced-by-count":2,"title":["Three Kinds of Integer Programming Algorithms Based on Barvinok\u2019s Rational Functions"],"prefix":"10.1007","author":[{"given":"J. A.","family":"De Loera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Haws","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Hemmecke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Huggins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-47867-1_25","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Aardal","year":"2002","unstructured":"Aardal, K., Lenstra, A.K., Lenstra Jr., H.W.: Hard equality constrained integer knapsacks. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 350\u2013366. Springer, Heidelberg (2002) (preliminary version)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0166-218X(01)00337-7","volume":"123","author":"K. Aardal","year":"2002","unstructured":"Aardal, K., Weismantel, R., Wolsey, L.: Non-Standard Approaches to Integer Programming. Discrete Applied Mathematics\u00a0123, 5\u201374 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"A.I. Barvinok","year":"1994","unstructured":"Barvinok, A.I.: Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math of Operations Research\u00a019, 769\u2013779 (1994)","journal-title":"Math of Operations Research"},{"key":"19_CR4","series-title":"Math. Sci. Res. Inst. Publ.","first-page":"91","volume-title":"New Perspectives in Algebraic Combinatorics","author":"A.I. Barvinok","year":"1999","unstructured":"Barvinok, A.I., Pommersheim, J.: An algorithmic theory of lattice points in polyhedra. In: New Perspectives in Algebraic Combinatorics, Berkeley, CA, 1996- 1997. Math. Sci. Res. Inst. Publ., vol.\u00a038, pp. 91\u2013147. Cambridge Univ. Press, Cambridge (1999)"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1090\/S0894-0347-03-00428-4","volume":"16","author":"A.I. Barvinok","year":"2003","unstructured":"Barvinok, A.I., Woods, K.: Short rational generating functions for lattice point problems. Available at arXiv.math.CO.0211146. J. Amer. Math. Soc.\u00a016, 957\u2013979 (2003)","journal-title":"Available at arXiv.math.CO.0211146. J. Amer. Math. Soc."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-63397-9_8","volume-title":"Algorithms - ESA \u201997","author":"G. Cornu\u00e9jols","year":"1997","unstructured":"Cornu\u00e9jols, G., Urbaniak, R., Weismantel, R., Wolsey, L.A.: Decomposition of integer programs and of generating sets. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol.\u00a01284, pp. 92\u2013103. Springer, Heidelberg (1997)"},{"key":"19_CR7","unstructured":"De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. To appear in Journal of Symbolic Computation"},{"key":"19_CR8","unstructured":"De Loera, J.A., Haws, D., Hemmecke, R., Huggins, P., Sturmfels, B., Yoshida, R.: Short rational functions for toric algebra and applications. Available at arXiv.math.CO.0307350. To appear in Journal of Symbolic Computation"},{"key":"19_CR9","unstructured":"De Loera, J.A., Haws, D., Hemmecke, R., Huggins, P., Tauzer, J., Yoshida, R.: A User\u2019s Guide for LattE v1.1 (2003), Software package LattE is available at \n                    \n                      http:\/\/www.math.ucdavis.edu\/~latte\/"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1287\/moor.22.3.545","volume":"22","author":"M. Dyer","year":"1997","unstructured":"Dyer, M., Kannan, R.: On Barvinok\u2019s algorithm for counting lattice points in fixed dimension. Math of Operations Research\u00a022, 545\u2013549 (1997)","journal-title":"Math of Operations Research"},{"key":"19_CR11","unstructured":"Hosten, S., Sturmfels, B.: Computing the integer programming gap. Available at math arXiv math.OC\/0301266 (2003)"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(03)00098-1","volume":"32","author":"J.B. Lasserre","year":"2004","unstructured":"Lasserre, J.B.: Integer programming, Barvinok\u2019s counting algorithm and Gomory relaxations. Operations Research Letters\u00a032(2), 133\u2013137 (2004)","journal-title":"Operations Research Letters"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer Programming with a fixed number of variables. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"19_CR14","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley Interscience, Hoboken (1986)"},{"key":"19_CR15","volume-title":"Encyclopedia of Optimization","author":"R. Thomas","year":"2001","unstructured":"Thomas, R.: Algebraic methods in integer programming. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, Kluwer Academic Publishers, Dordrecht (2001)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25960-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T23:07:15Z","timestamp":1552864035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25960-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221135","9783540259602"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25960-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}