A Complexity and Approximability Study of the Bilevel Knapsack Problem-Reference-Cited by-同舟云学术

A Complexity and Approximability Study of the Bilevel Knapsack Problem

Published:2013 Issue: Volume: Page:98-109
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Caprara Alberto,Carvalho Margarida,Lodi Andrea,Woeginger Gerhard J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-36694-9_9

Reference18 articles.

1. Brotcorne, L., Hanafi, S., Mansi, R.: A dynamic programming algorithm for the bilevel knapsack problem. Operations Research Letters 37, 215–218 (2009)

2. Brotcorne, L., Hanafi, S., Mansi, R.: One-level reformulation of the bilevel knapsack problem using dynamic programming. Technical Report, Université de Valenciennes et du Hainaut-Cambrésis, France (2011)

3. Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)

4. Dempe, S., Richter, K.: Bilevel programming with Knapsack constraint. Central European Journal of Operations Research 8, 93–107 (2000)

5. DeNegre, S.: Interdiction and discrete bilevel linear programming. Ph.D. dissertation, Lehigh University (2011)

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem;Mathematical Programming Computation;2023-07-10

2. Optimally Blending Honeypots into Production Networks: Hardness and Algorithms;Science of Cyber Security;2023

3. Transmission Expansion Planning Outside the Box: A Bilevel Approach;Transmission Expansion Planning: The Network Challenges of the Energy Transition;2020-11-20

4. On Bilevel Optimization with Inexact Follower;Decision Analysis;2020-03

5. An exact approach for the bilevel knapsack problem with interdiction constraints and extensions;Mathematical Programming;2020-02-26