{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T14:11:46Z","timestamp":1656252706282},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,9,3]],"date-time":"2011-09-03T00:00:00Z","timestamp":1315008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s10878-011-9411-5","type":"journal-article","created":{"date-parts":[[2011,9,6]],"date-time":"2011-09-06T16:22:11Z","timestamp":1315326131000},"page":"613-626","source":"Crossref","is-referenced-by-count":4,"title":["LLL-reduction for integer knapsacks"],"prefix":"10.1007","volume":"24","author":[{"given":"Iskander","family":"Aliev","sequence":"first","affiliation":[]},{"given":"Martin","family":"Henk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,3]]},"reference":[{"issue":"3","key":"9411_CR1","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1287\/moor.1040.0099","volume":"29","author":"K Aardal","year":"2004","unstructured":"Aardal K, Lenstra A (2004) Hard equality constrained integer knapsacks. Math Oper Res 29(3):724\u2013738","journal-title":"Math Oper Res"},{"key":"9411_CR2","doi-asserted-by":"crossref","first-page":"2978","DOI":"10.1137\/090778043","volume":"20","author":"I Aliev","year":"2010","unstructured":"Aliev I, Henk M (2010) Feasibility of integer knapsacks. SIAM J Optim 20:2978\u20132993","journal-title":"SIAM J Optim"},{"issue":"1","key":"9411_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai L (1986) On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1):1\u201313","journal-title":"Combinatorica"},{"key":"9411_CR4","doi-asserted-by":"crossref","unstructured":"Beihoffer D, Hendry J, Nijenhuis A, Wagon S (2005) Faster algorithms for Frobenius numbers. Electron J Comb 12. Research Paper 27, 38 pp (electronic)","DOI":"10.37236\/1924"},{"key":"9411_CR5","volume-title":"An introduction to the geometry of numbers","author":"JWS Cassels","year":"1971","unstructured":"Cassels JWS (1971) An introduction to the geometry of numbers. Springer, Berlin"},{"issue":"4","key":"9411_CR6","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1287\/moor.1080.0320","volume":"33","author":"F Eisenbrand","year":"2008","unstructured":"Eisenbrand F, Shmonin G (2008) Parametric integer programming in fixed dimension. Math Oper Res 33(4):839\u2013850","journal-title":"Math Oper Res"},{"issue":"3","key":"9411_CR7","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s00454-006-1295-2","volume":"37","author":"L Fukshansky","year":"2007","unstructured":"Fukshansky L, Robins S (2007) Frobenius problem and the covering radius of a lattice. Discrete Comput Geom 37(3):471\u2013483","journal-title":"Discrete Comput Geom"},{"key":"9411_CR8","series-title":"Algorithms and combinatorics: study and research texts","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Algorithms and combinatorics: study and research texts, vol 2. Springer, Berlin"},{"key":"9411_CR9","volume-title":"Convex and discrete geometry","author":"PM Gruber","year":"2007","unstructured":"Gruber PM (2007) Convex and discrete geometry. Springer, Berlin"},{"key":"9411_CR10","volume-title":"Geometry of numbers","author":"PM Gruber","year":"1987","unstructured":"Gruber PM, Lekkerkerker CG (1987) Geometry of numbers. North-Holland, Amsterdam"},{"issue":"3","key":"9411_CR11","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/0377-2217(94)00214-2","volume":"88","author":"P Hansen","year":"1996","unstructured":"Hansen P, Ryan J (1996) Testing integer knapsacks for feasibility. Eur J Oper Res 88(3):578\u2013582","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9411_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01204720","volume":"12","author":"R Kannan","year":"1992","unstructured":"Kannan R (1992) Lattice translates of a polytope and the Frobenius problem. Combinatorica 12(2):161\u2013177","journal-title":"Combinatorica"},{"issue":"3","key":"9411_CR13","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0022-314X(80)90028-1","volume":"12","author":"MJ Knight","year":"1980","unstructured":"Knight MJ (1980) A generalization of a result of Sylvester\u2019s. J Number Theory 12(3):364\u2013366","journal-title":"J Number Theory"},{"key":"9411_CR14","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1137\/080718103","volume":"23","author":"J Lee","year":"2009","unstructured":"Lee J, Onn S, Weismantel R (2009) Approximate nonlinear optimization over a weighted independence systems. SIAM J Discrete Math 23:1667\u20131681","journal-title":"SIAM J Discrete Math"},{"issue":"4","key":"9411_CR15","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra AK, Lenstra HW Jr., Lov\u00e1sz L (1982) Factoring polynomials with rational coefficients. Math Ann 261(4):515\u2013534","journal-title":"Math Ann"},{"key":"9411_CR16","series-title":"Grundlehren der Mathematischen Wissenschaften","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05167-2","volume-title":"Perfect lattices in Euclidean spaces","author":"J Martinet","year":"2003","unstructured":"Martinet J (2003) Perfect lattices in Euclidean spaces. Grundlehren der Mathematischen Wissenschaften, vol 327. Springer, Berlin"},{"issue":"3","key":"9411_CR17","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1112\/blms\/16.3.275","volume":"16","author":"P McMullen","year":"1984","unstructured":"McMullen P (1984) Determinants of lattices induced by rational subspaces. Bull Lond Math Soc 16(3):275\u2013277","journal-title":"Bull Lond Math Soc"},{"key":"9411_CR18","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Dover, Mineola"},{"key":"9411_CR19","first-page":"27","volume":"32","author":"P Pleasants","year":"2005","unstructured":"Pleasants P, Ray H, Simpson J (2005) The Frobenius problem on lattices. Australas J Comb 32:27\u201345","journal-title":"Australas J Comb"},{"issue":"1","key":"9411_CR20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01300131","volume":"16","author":"JL Ram\u00edrez Alfons\u00edn","year":"1996","unstructured":"Ram\u00edrez Alfons\u00edn JL (1996) Complexity of the Frobenius problem. Combinatorica 16(1):143\u2013147","journal-title":"Combinatorica"},{"key":"9411_CR21","series-title":"Oxford lecture series in mathematics and its applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001","volume-title":"The Diophantine Frobenius problem","author":"JL Ram\u00edrez Alfons\u00edn","year":"2005","unstructured":"Ram\u00edrez Alfons\u00edn JL (2005) The Diophantine Frobenius problem. Oxford lecture series in mathematics and its applications"},{"key":"9411_CR22","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of linear and integer programming. Wiley, Chichester"},{"issue":"6","key":"9411_CR23","doi-asserted-by":"crossref","first-page":"1661","DOI":"10.1090\/S0002-9939-03-06970-3","volume":"131","author":"RJ Simpson","year":"2003","unstructured":"Simpson RJ, Tijdeman R (2003) Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester. Proc Am Math Soc 131(6):1661\u20131671","journal-title":"Proc Am Math Soc"},{"issue":"2","key":"9411_CR24","doi-asserted-by":"crossref","first-page":"543","DOI":"10.2140\/pjm.1979.83.543","volume":"83","author":"J Vaaler","year":"1979","unstructured":"Vaaler J (1979) A geometric inequality with applications to linear forms. Pac J Math 83(2):543\u2013553","journal-title":"Pac J Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9411-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9411-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9411-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T06:31:49Z","timestamp":1592893909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9411-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,3]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9411"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9411-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,3]]}}}