Approximation Algorithms for a Bi-level Knapsack Problem

DOI10.1007/978-3-642-22616-8_31MaRDI QIDQ5199165zbMATH OpenOpenAlexFDO

Authors Lin Chen, Guochuan Zhang

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

zbMATH Keywords

approximation algorithmsbilevel knapsack problem

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation algorithms for a bi-level knapsack problem
• Improved approximation algorithms for a bilevel knapsack problem
• Improved approximation algorithms for a bilevel knapsack problem
• A complexity and approximability study of the bilevel knapsack problem
• Approximation algorithms for a two-phase knapsack problem
• An exact algorithm for bilevel 0-1 knapsack problems
• Solution techniques for bi-level knapsack problems
• A new approximation algorithm for the knapsack problem
• On the approximability of the two-phase knapsack problem
• Approximation algorithms for knapsack problems with cardinality constraints

Cited in

(8)

• Approximation algorithms for a two-phase knapsack problem
• An exact algorithm for bilevel 0-1 knapsack problems
• Improved approximation algorithms for a bilevel knapsack problem
• Improved approximation algorithms for a bilevel knapsack problem
• Bilevel knapsack with interdiction constraints
• Approximation algorithms for a bi-level knapsack problem
• Solution techniques for bi-level knapsack problems
• An approximation scheme for a bilevel knapsack problem

This page was built for publication: Approximation Algorithms for a Bi-level Knapsack Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199165)