Approximation Algorithms for a Bi-level Knapsack Problem
From MaRDI portal
Publication:5199165
DOI10.1007/978-3-642-22616-8_31zbMath1342.90156OpenAlexW55710781MaRDI QIDQ5199165
Publication date: 12 August 2011
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_31
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (2)
Bilevel Knapsack with Interdiction Constraints ⋮ Improved approximation algorithms for a bilevel knapsack problem
This page was built for publication: Approximation Algorithms for a Bi-level Knapsack Problem