Computing Knapsack Solutions with Cardinality Robustness

DOI10.1007/978-3-642-25591-5_71zbMath1350.68150OpenAlexW1601835603MaRDI QIDQ3104670

Naonori Kakimura, Kazuhisa Makino, Kento Seimi

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_71

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Packing a Knapsack of Unknown Capacity ⋮ Computing knapsack solutions with cardinality robustness

This page was built for publication: Computing Knapsack Solutions with Cardinality Robustness