A dynamic programming algorithm for the bilevel knapsack problem

被引:38
|
作者
Brotcorne, Luce [1 ]
Hanafi, Said [1 ]
Mansi, Raid [1 ]
机构
[1] UVHC Le Mt Houy, LAMIH ROI, ISTV2, F-59313 Valenciennes 9, France
关键词
Knapsack problem; Bilevel programming; Dynamic programming;
D O I
10.1016/j.orl.2009.01.007
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We propose an efficient dynamic programming algorithm for solving a bilevel program where the leader controls the capacity of a knapsack, and the follower solves the resulting knapsack problem. We propose new recursive rules and show how to solve the problem as a sequence of two standard knapsack problems. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:215 / 218
页数:4
相关论文
共 50 条
  • [41] A Bilevel Programming Model and Algorithm for the Static Bike Repositioning Problem
    Tang, Qiong
    Fu, Zhuo
    Qiu, Meng
    [J]. JOURNAL OF ADVANCED TRANSPORTATION, 2019, 2019
  • [42] A globally convergent algorithm for a class of bilevel nonlinear programming problem
    Wang, Guangmin
    Wang, Xianjia
    Wan, Zhongping
    Lv, Yibing
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (01) : 166 - 172
  • [43] Solution Algorithm of the Fuzzy Fractional Bilevel Linear Programming Problem
    Amiri, Neda
    Hamidi, Farhad
    Nehi, Hassan Mishmast
    [J]. 2015 4th Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS), 2015,
  • [44] An adaptive genetic algorithm for solving bilevel linear programming problem
    王广民
    王先甲
    万仲平
    贾世会
    [J]. Applied Mathematics and Mechanics(English Edition), 2007, (12) : 1605 - 1612
  • [45] Improved dynamic programming and approximation results for the knapsack problem with setups
    Pferschy, Ulrich
    Scatamacchia, Rosario
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2018, 25 (02) : 667 - 682
  • [46] ON THE SOLUTION OF MULTIDIMENSIONAL INTEGER KNAPSACK PROBLEM WITH DYNAMIC PROGRAMMING TECHNIQUE
    Nuri, Elnur
    Nuriyeva, Fidan
    Nuriyev, Urfat
    [J]. PROCEEDINGS OF THE7TH INTERNATIONAL CONFERENCE ON CONTROL AND OPTIMIZATION WITH INDUSTRIAL APPLICATIONS, VOL. 1, 2020, : 302 - 304
  • [47] A dynamic programming method with dominance technique for the knapsack sharing problem
    Boyer, V.
    El Baz, D.
    Elkihel, M.
    [J]. CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 348 - 353
  • [48] Revisiting Sparse Dynamic Programming for the 0/1 Knapsack Problem
    Sifat, Tarequl Islam
    Prajapati, Nirmal
    Rajopadhye, Sanjay
    [J]. PROCEEDINGS OF THE 49TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, ICPP 2020, 2020,
  • [49] A Genetic Algorithm for the Multiple Knapsack Problem in Dynamic Environment
    Unal, Ali Nadi
    [J]. WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, WCECS 2013, VOL II, 2013, Ao, : 1162 - 1167
  • [50] An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
    Perry, Thomas C.
    Hartman, Joseph C.
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2009, 16 (03) : 347 - 359