论文信息 - A polynomial algorithm for a continuous bilevel knapsack problem

A polynomial algorithm for a continuous bilevel knapsack problem

Abstract In this note, we analyze a bilevel interdiction problem, where the follower’s program is a parametrized continuous knapsack. Based on the structure of the problem and an inverse optimization strategy, we propose for its solution an algorithm with worst-case complexity O ( n 2 ) .

Andrea Lodi | Patrice Marcotte | Margarida Carvalho

[1] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[2] Saïd Hanafi,et al. A dynamic programming algorithm for the bilevel knapsack problem , 2009, Oper. Res. Lett..

[3] Saïd Hanafi,et al. One-level reformulation of the bilevel Knapsack problem using dynamic programming , 2013, Discret. Optim..

[4] Kenneth L. Clarkson,et al. Linear Programming in O(n * (3_d)_2) Time , 1986, Inf. Process. Lett..

[5] Gerhard J. Woeginger,et al. Bilevel Knapsack with Interdiction Constraints , 2016, INFORMS J. Comput..

[6] Walter Kern,et al. Improved approximation algorithms for a bilevel knapsack problem , 2015, Theor. Comput. Sci..

[7] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[8] Stephan Dempe,et al. Bilevel Programming With Knapsack Constraints , 2000 .

[9] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .