Author:
Agnetis Alessandro,Detti Paolo,Pranzo Marco,Sodhi Manbir S.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference11 articles.
1. Bertsimas, D., & Niño-Mora, J. (1996). Conservation laws, extended polymatroids and multi-armed bandit problems: a polyhedral approach to indexable systems. Mathematics of Operations Research, 21, 257–306.
2. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability—a guide to the theory of NP-completeness. New York: Freeman.
3. Edmonds, J. (1970). Submodular functions, matroids and certain polyhedra. In R. Guy (Ed.), Combinatorial structures and their applications (pp. 68–87). New York: Gordon and Breach.
4. Gittins, J. C. (1979). Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society, 41, 148–177.
5. Hellerstein, J., & Stonebraker, M. (1993). Predicate migration: optimizing queries with expensive predicates. In Proceedings of the 1993 ACM SIGMOD international conference on management of data (pp. 267—276).
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献