Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Brotcorne, L., Hanafi, S., Mansi, R.: A dynamic programming algorithm for the bi-level knapsack problem. Operations Research Letters 37, 215–218 (2009)
2. Colson, B., Marcotte, P., Savard, G.: Bilevel programming, A survey. 4OR: A Quarterly Journal of Operations Research 3(2), 87–107 (2005)
3. Dempe, S., Richter, K.: Bilevel programming with Knapsack constraint. Central European Journal of Operations Research 8, 93–107 (2000)
4. Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM 22, 363–468 (1975)
5. Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, pp. 404–413 (1999)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献