Approximation algorithms for a bi-level knapsack problem

DOI10.1016/j.tcs.2012.08.008zbMath1351.90139OpenAlexW1996027772MaRDI QIDQ391212

Lin Chen, Guo-Chuan Zhang

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.008

zbMATH Keywords

approximation algorithmsbilevel knapsack problem

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (7)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Solution techniques for bi-level knapsack problems ⋮ An exact approach for the bilevel knapsack problem with interdiction constraints and extensions ⋮ On the Stackelberg knapsack game ⋮ Computational complexity characterization of protecting elections from bribery ⋮ A Stackelberg knapsack game with weight control

Cites Work

• Unnamed Item
• Two-person knapsack game
• Bilevel programming: a survey
• A dynamic programming algorithm for the bilevel Knapsack problem
• Weak via strong Stackelberg problem: New results
• Two-group knapsack game
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Bilevel programming with knapsack constraints

This page was built for publication: Approximation algorithms for a bi-level knapsack problem