On allocating limited sampling resources using a learning automata-based solution to the fractional knapsack problem

Advances in Soft Computing

Volumn 35, Issue , 2006, Pages 263-272

  Granmo, Ole Christoffer ^a   Oommen, B John ^a,b  

^a UNIVERSITY OF AGDER   (Norway)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70249094297     PISSN: 16153871     EISSN: 18600794     Source Type: Book Series    
DOI: 10.1007/3-540-33521-8_26     Document Type: Conference Paper

References (16)

1. Fractional knapsack problem. http://www.nist.gov/dads/HTML/ fractionalKnapsack.html, 2004. NIST.
2. G. K. Bhattacharyya and R. A. Johnson. Statistical Concepts and Methods. John Wiley & Sons, 1977.
3. K. M. Bretthauer and B. Shetty. The Nonlinear Knapsack Problem - Algorithms and Applications. European Journal of Operational Research 138:459-472, 2002.
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-217. IEEE, 2004.
5. B. Fox. Discrete optimization via marginal analysis. Management Sciences, 13(3):211-216, 1966.
6. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
7. K. S. Narendra and M. A. L. Thathachar. Learning Automata: An Introduction. Prentice Hall, 1989.
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-739, 1997.
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.
10. K. W. Ross and D.H.K. Tsang. The stochastic knapsack problem. IEEE Transactions on Communications, 37(7), 1989.
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.
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-147, 1979.
13. M. A. L. Thathachar and P. S. Sastry. Networks of Learning Automata: Techniques for Online Stochastic Optimization. Kluwer Academic Publishers, 2004.
14. M. L. Tsetlin. Automaton Theory and Modeling of Biological Systems Academic Press, 1973.
15. Z. Xiaoming. Evaluation and Enhancement of Web Content Accessibility for Persons with Disabilities. PhD thesis, University of Pittsburgh, 2004.
16. Q. Zhu and B. J. Oommen. Some Fundamental Results on Optimal Search with Unknown Target Distributions. Submitted for Publication, 2005.