![]() | Up a level |
Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (2016). Bilevel knapsack with interdiction constraints. INFORMS Journal on Computing, 28(2), 319-333. External link
Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (2014). A study on the computational complexity of the bilevel knapsack problem. SIAM Journal on Optimization, 24(2), 823-838. External link
Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (2013, March). A complexity and approximability study of the bilevel knapsack problem [Paper]. 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), Valparaiso, Chile. External link
Lodi, A., Ralphs, T. K., & Woeginger, G. J. (2014). Bilevel programming and the separation problem. Mathematical Programming, 146(1-2), 437-458. External link