Publisher
Springer International Publishing
Reference22 articles.
1. DeNegre S (2011) Interdiction and discrete bilevel linear programming. Ph.D. thesis, Lehigh University
2. Brotcorne L, Hanafi S, Mansi R (2009) A dynamic programming algorithm for the bilevel knapsack problem. Oper Res Lett 37(3):215–218. ISSN 0167-6377. https://doi.org/10.1016/j.orl.2009.01.007, https://www.sciencedirect.com/science/article/pii/S0167637709000066
3. Mansi R, Alves C, Valério de Carvalho JM, Hanafi S (2012) An exact algorithm for bilevel 0-1 knapsack problems. Math Probl Eng 2012:23. https://doi.org/10.1155/2012/504713. Article ID 504713
4. Carvalho M, Lodi A, Marcotte P (2018) A polynomial algorithm for a continuous bilevel knapsack problem. Oper Res Lett 46(2):185–188. ISSN 0167-6377. https://doi.org/10.1016/j.orl.2017.12.009, https://www.sciencedirect.com/science/artic le/pii/S0167637717302870
5. Dempe S, Richter K (2000) Bilevel programming with knapsack constraints. CEJOR Centr Eur J Oper Res 2(8):93–107