{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:06:50Z","timestamp":1742400410510},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540335207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-33521-8_26","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T03:10:01Z","timestamp":1183432201000},"page":"263-272","source":"Crossref","is-referenced-by-count":6,"title":["On Allocating Limited Sampling Resources Using a Learning Automata-based Solution to the Fractional Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Ole-Christofier","family":"Granmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. John","family":"Oommen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"1. Fractional knapsack problem. http:\/\/www.nist.gov\/dads\/HTML\/fractional Knapsack.html, 2004. NIST.","key":"26_CR1"},{"unstructured":"2. G. K. Bhattacharyya and R. A. Johnson. Statistical Concepts and Methods. John Wiley & Sons, 1977.","key":"26_CR2"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S0377-2217(01)00179-5","volume":"138","author":"K. M. Bretthauer","year":"2002","unstructured":"3. K. M. Bretthauer and B. Shetty. The Nonlinear Knapsack Problem - Algorithms and Applications. European Journal of Operational Research, 138:459\u2013 472, 2002.","journal-title":"European Journal of Operational Research"},{"doi-asserted-by":"crossref","unstructured":"4. B. C. Dean, M. X. Goemans, and J. Vondrdk. Approximating the Stochastic Knapsack Problem: the benefit of adaptivity. In 45th Annual IEEE Symposium on Foundations of Computer Science, pages 208\u2013217. IEEE, 2004.","key":"26_CR4","DOI":"10.1109\/FOCS.2004.15"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/mnsc.13.3.210","volume":"13","author":"B. Fox","year":"1966","unstructured":"5. B. Fox. Discrete optimization via marginal analysis. Management Sciences, 13(3):211\u2013216, 1966.","journal-title":"Management Sciences"},{"doi-asserted-by":"crossref","unstructured":"6. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.","key":"26_CR6","DOI":"10.1007\/978-3-540-24777-7"},{"unstructured":"7. K. S. Narendra and M. A. L. Thathachar. Learning Automata: An Introduction. Prentice Hall, 1989.","key":"26_CR7"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/3477.604122","volume":"27","author":"B. J. Oommen","year":"1997","unstructured":"8. B. J. Oommen. Stochastic searching on the line and its applications to parameter learning in nonlinear optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 27(4):733\u2013739, 1997.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B"},{"doi-asserted-by":"crossref","unstructured":"9. B. J. Oommen and L. Rueda. Stochastic Learning-based Weak Estimation of Multinomial Random Variables and its Applications to Pattern Recognition in Non-stationary Environments. Pattern Recognition, 2006.","key":"26_CR9","DOI":"10.1016\/j.patcog.2005.09.007"},{"doi-asserted-by":"crossref","unstructured":"10. K. W. Ross and D.H.K. Tsang. The stochastic knapsack problem. IEEE Transactions on Communications, 37(7), 1989.","key":"26_CR10","DOI":"10.1109\/26.31166"},{"unstructured":"11. M. Snaprud, N. Ulltveit-Moe, O.-C. Granmo, M. Rafoshei-Klev, A. Wiklund, and A. Sawicka. Quantitative Assessment of Public Web Sites Accessibility - Some Early Results. In The Accessibility for All Conference, 2003.","key":"26_CR11"},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.2307\/3009295","volume":"30","author":"E. Steinberg","year":"1979","unstructured":"12. E. Steinberg and M. S. Parks. A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards. The Journal of the Operational Research Society, 30(2):141\u2013147, 1979.","journal-title":"The Journal of the Operational Research Society"},{"doi-asserted-by":"crossref","unstructured":"13. M. A. L. Thathachar and P. S. Sastry. Networks of Learning Automata: Techniques for Online Stochastic Optimization. Kluwer Academic Publishers, 2004.","key":"26_CR13","DOI":"10.1007\/978-1-4419-9052-5"},{"unstructured":"14. M. L. Tsetlin. Automaton Theory and Modeling of Biological Systems. Academic Press, 1973.","key":"26_CR14"},{"unstructured":"15. Z. Xiaoming. Evaluation and Enhancement of Web Content Accessibility for Persons with Disabilities. PhD thesis, University of Pittsburgh, 2004.","key":"26_CR15"},{"unstructured":"16. Q. Zhu and B. J. Oommen. Some Fundamental Results on Optimal Search with Unknown Target Distributions. Submitted for Publication, 2005.","key":"26_CR16"}],"container-title":["Advances in Soft Computing","Intelligent Information Processing and Web Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-33521-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:02Z","timestamp":1605646562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-33521-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540335207"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-33521-8_26","relation":{},"subject":[]}}