An improved approximation scheme for variable-sized bin packing
From MaRDI portal
Publication:504994
DOI10.1007/s00224-015-9644-2zbMath1356.68265MaRDI QIDQ504994
Publication date: 18 January 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-015-9644-2
knapsack problem; bin packing; asymptotic fully polynomial time approximation scheme (AFPTAS); fully polynomial time approximation scheme (FPTAS); knapsack problem with inversely proportional profits; variable-sized bin packing
68Q25: Analysis of algorithms and problem complexity
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68W25: Approximation algorithms