{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:43Z","timestamp":1725550483037},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540296737"},{"type":"electronic","value":"9783540320913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_9","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T10:06:19Z","timestamp":1130148379000},"page":"90-100","source":"Crossref","is-referenced-by-count":0,"title":["Successive Linear Programs for Computing All Integral Points in a Minkowski Sum"],"prefix":"10.1007","author":[{"given":"Ioannis Z.","family":"Emiris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyriakos","family":"Zervoudakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Amarasinghe, S.P.: Parallelizing Compiler Techniques Based on Linear Inequalities. Ph.D. thesis, Computer Systems Lab., Stanford University (1997)"},{"key":"9_CR2","unstructured":"Christof, T., Loebel, A., Stoer, M.: PORTA 1.3.2. Univ. of Heidelberg and ZIB Berlin PORTA (1999), http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/"},{"key":"9_CR3","first-page":"1","volume":"4","author":"T. Christof","year":"1996","unstructured":"Christof, T., Reinelt, G.: Combinatorial Optimization and Small Polytopes. Top (Spanish Statistical and Operations Research Society)\u00a04, 1\u201364 (1996)","journal-title":"Top (Spanish Statistical and Operations Research Society)"},{"key":"9_CR4","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V.: Linear Programming. W.H. Freeman & Co, New York (1983)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Clauss, P.: Counting Solutions to Linear and Nonlinear Constraints Through Ehrart Polynomials: Applications to Analyze and Transform Scientific Programs. In: Intern. Conf. Supercomp, pp. 278\u2013285 (1996)","DOI":"10.1145\/237578.237617"},{"key":"9_CR6","unstructured":"The Computational Algebra Group. Magma 2.8. University of Sydney, Australia, http:\/\/magma.maths.usyd.edu.au\/magma\/"},{"key":"9_CR7","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":"Cox, D., Little, J., O\u2019Shea, D.: Using Algebraic Geometry. Graduate Texts in Mathematics, vol.\u00a0185. Springer, New York (1998)"},{"issue":"3-4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0747-7171(03)00086-5","volume":"36","author":"A. Dickenstein","year":"2003","unstructured":"Dickenstein, A., Emiris, I.Z.: Multihomogeneous Resultant Formulae by Means of Complexes. J. Symb. Computation\u00a036(3-4), 317\u2013342 (2003)","journal-title":"J. Symb. Computation"},{"key":"9_CR9","unstructured":"Emiris, I.Z., Zervoudakis, K.: Successive Linear Programs for Computing all Integral Points in a Minkowski Sum, http:\/\/www.di.uoa.gr\/~quasi\/EmiZer.pdf"},{"issue":"1\u20133","key":"9_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0925-7721(01)00049-9","volume":"22","author":"I.Z. Emiris","year":"2002","unstructured":"Emiris, I.Z.: Enumerating a subset of the integer points inside a Minkowski sum. Comp. Geom.: Theory & Appl., Spec. Issue\u00a022(1\u20133), 143\u2013166 (2002)","journal-title":"Comp. Geom.: Theory & Appl., Spec. Issue"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/jsco.1995.1041","volume":"20","author":"I.Z. Emiris","year":"1995","unstructured":"Emiris, I.Z., Canny, J.F.: Efficient incremental algorithms for the sparse resultant and the mixed volume. J.\u00a0Symbolic Computation\u00a020(2), 117\u2013149 (1995)","journal-title":"J.\u00a0Symbolic Computation"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Gelfand, I.M., Kapranov, M.M., Zelevinsky, A.V.: Discriminants, Resultants and Multidimensional Determinants, Birkh\u00e4user, Boston (1994)","DOI":"10.1007\/978-0-8176-4771-1"},{"key":"9_CR13","unstructured":"GNU Project, SciFace Software GmbH. GLPK 3.2.3, GNU LInear Programming Kit, http:\/\/www.gnu.org\/software\/glpk"},{"key":"9_CR14","first-page":"491","volume-title":"The Handbook of Discrete and Computational Geometry","author":"P. Gritzmann","year":"1997","unstructured":"Gritzmann, P., Klee, V.: Computational convexity. In: Goodman, J.E., O\u2019Rourke, J. (eds.) The Handbook of Discrete and Computational Geometry, pp. 491\u2013516. CRC Press, Boca Raton (1997)"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1137\/0406019","volume":"6","author":"P. Gritzmann","year":"1993","unstructured":"Gritzmann, P., Sturmfels, B.: Minkowski addition of polytopes: Computational complexity and applications to Groebner bases. SIAM J. Disc. Math.\u00a06(2), 246\u2013269 (1993)","journal-title":"SIAM J. Disc. Math."},{"key":"9_CR16","unstructured":"Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin. SoPlex 1.2.1, Sequential Object-oriented simPLEX class library, http:\/\/www.zib.de\/Optimization\/Software\/Soplex"},{"key":"9_CR17","unstructured":"Lewis, R.: Fermat, A Computer Algebra System for Polynomial and Matrix Computation. Fordham University, New York, http:\/\/www.bway.net\/~lewis"},{"key":"9_CR18","unstructured":"Mourrain, B.: Symbolic Numeric Applications, INRIA Sophia-Antipolis (2002), http:\/\/www-sop.inria.fr\/galaad\/synaps\/"},{"key":"9_CR19","unstructured":"ILOG S.A. Planner 3.3, Reference Manual (2001)"},{"key":"9_CR20","unstructured":"PolyLib, A library of polyhedral functions (2002), http:\/\/icps.u-strasbg.fr\/polylibs"},{"key":"9_CR21","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1982","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. J. Wiley & Sons, Chichester (1982)"},{"issue":"1","key":"9_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1006\/jabr.1994.1007","volume":"163","author":"B. Sturmfels","year":"1994","unstructured":"Sturmfels, B., Zelevinsky, A.: Multigraded Resultants of Sylvester Type. J.\u00a0of Algebra\u00a0163(1), 115\u2013127 (1994)","journal-title":"J.\u00a0of Algebra"},{"key":"9_CR23","unstructured":"Whaley, R.C., Patitet, A., Dongarra, J.J.: Automated empirical optimization of software and the ATLAS project, http:\/\/netlib.uow.edu.au\/atlas\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:56:12Z","timestamp":1605642972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11573036_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}