{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:02:24Z","timestamp":1774368144917,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540280613","type":"print"},{"value":"9783540318064","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_97","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"965-974","source":"Crossref","is-referenced-by-count":16,"title":["The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(ka 1)"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"B\u00f6cker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsuzsanna","family":"Lipt\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"97_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/moor.25.3.427.12219","volume":"25","author":"K. Aardal","year":"2000","unstructured":"Aardal, K., Hurkens, C., Lenstra, A.K.: Solving a system of diophantine equations with lower and upper bounds on the variables. Math. Operations Research\u00a025, 427\u2013442 (2000)","journal-title":"Math. Operations Research"},{"key":"97_CR2","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.: Hard equality constrained integer knapsacks. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 350\u2013366. Springer, Heidelberg (2002)"},{"key":"97_CR3","unstructured":"Beihoffer, D.E., Hendry, J., Nijenhuis, A., Wagon, S.: Faster algorithms for Frobenius numbers (in preparation)"},{"key":"97_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6cker, S., Lipt\u00e1k, Z.: Efficient mass decomposition. In: Proc. of ACM Symposium on Applied Computing, Santa Fe, USA, pp. 151\u2013157 (2005)","DOI":"10.1145\/1066677.1066715"},{"key":"97_CR5","first-page":"215","volume":"211","author":"A. Brauer","year":"1962","unstructured":"Brauer, A., Shockley, J.E.: On a problem of Frobenius. J. Reine Angew. Math.\u00a0211, 215\u2013220 (1962)","journal-title":"J. Reine Angew. Math."},{"issue":"3","key":"97_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1006\/jnth.1994.1071","volume":"48","author":"J.L. Davison","year":"1994","unstructured":"Davison, J.L.: On the linear diophantine problem of Frobenius. J. Number Theory\u00a048(3), 353\u2013363 (1994)","journal-title":"J. Number Theory"},{"key":"97_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"97_CR8","volume-title":"Concrete Mathematics","author":"R.L. Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison- Wesley, Reading (1994)","edition":"2"},{"issue":"3","key":"97_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0196-6774(88)90025-9","volume":"9","author":"H. Greenberg","year":"1988","unstructured":"Greenberg, H.: Solution to a linear diophantine equation for nonnegative integers. J. Algorithms\u00a09(3), 343\u2013353 (1988)","journal-title":"J. Algorithms"},{"key":"97_CR10","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/BF01386084","volume":"6","author":"B.R. Heap","year":"1964","unstructured":"Heap, B.R., Lynn, M.S.: A graph-theoretic algorithm for the solution of a linear diophantine problem of Frobenius. Numer. Math.\u00a06, 346\u2013354 (1964)","journal-title":"Numer. Math."},{"key":"97_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01204720","volume":"12","author":"R. Kannan","year":"1991","unstructured":"Kannan, R.: Lattice translates of a polytope and the Frobenius problem. Combinatorica\u00a012, 161\u2013177 (1991)","journal-title":"Combinatorica"},{"key":"97_CR12","volume-title":"The Art of Computer Programming: Seminumerical Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, 3rd edn., vol.\u00a02. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"97_CR13","unstructured":"Lueker, G.S.: Two NP-complete problems in nonnegative integer programming. Technical Report TR-178, Department of Electrical Engineering, Princeton University (March 1975)"},{"key":"#cr-split#-97_CR14.1","doi-asserted-by":"crossref","unstructured":"Nijenhuis, A.: A minimal-path algorithm for the ???money changing problem???. Amer. Math. Monthly??86, 832???835 (1979);","DOI":"10.1080\/00029890.1979.11994924"},{"key":"#cr-split#-97_CR14.2","doi-asserted-by":"crossref","unstructured":"Correction in Amer. Math. Monthly 87, 377 (1980)","DOI":"10.1080\/00029890.1980.11995037"},{"issue":"1","key":"97_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01300131","volume":"16","author":"J.L. Ram\u00edrez-Alfons\u00edn","year":"1996","unstructured":"Ram\u00edrez-Alfons\u00edn, J.L.: Complexity of the Frobenius problem. Combinatorica\u00a016(1), 143\u2013147 (1996)","journal-title":"Combinatorica"},{"key":"97_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001","volume-title":"The Diophantine Frobenius Problem","author":"J.L. Ram\u00edrez-Alfons\u00edn","year":"2005","unstructured":"Ram\u00edrez-Alfons\u00edn, J.L.: The Diophantine Frobenius Problem. Oxford University Press, Oxford (2005) (to appear)"},{"key":"97_CR17","unstructured":"J. J. Sylvester and W. J. Curran Sharp. Problem 7382. Educational Times, 37:26, 1884."},{"key":"97_CR18","first-page":"562","volume":"85","author":"H. S. Wilf","year":"1978","unstructured":"H. S. Wilf. A circle-of-lights algorithm for the \u201cmoney-changing problem\u201d. Amer. Math. Monthly, 85:562\u2013565, 1978.","journal-title":"Amer. Math. Monthly"},{"issue":"1","key":"97_CR19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1145\/321864.321874","volume":"22","author":"J. W. Wright","year":"1975","unstructured":"J. W. Wright. The change-making problem. J. Assoc. Comput. Mach., 22(1):125\u2013 128, 1975.","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_97","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:37:39Z","timestamp":1586471859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_97"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11533719_97","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}