An APTAS for Generalized Cost Variable-Sized Bin Packing
From MaRDI portal
Publication:3614165
DOI10.1137/060670328zbMath1165.68035OpenAlexW1987387619MaRDI QIDQ3614165
Publication date: 16 March 2009
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060670328
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (17)
On the generalized bin packing problem ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ Optimal energy-efficient placement of virtual machines with divisible sizes ⋮ An AFPTAS for variable sized bin packing with general activation costs ⋮ Security-aware database migration planning ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ Bin packing with general cost structures ⋮ Vector bin packing with multiple-choice ⋮ Set Covering with Ordered Replacement: Additive and Multiplicative Gaps ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ The freight consolidation and containerization problem ⋮ Lower bounds for three-dimensional multiple-bin-size bin packing problems ⋮ Truthful mechanism design for bin packing with applications on cloud computing ⋮ Unnamed Item ⋮ Online Bin Packing with (1,1) and (2,R) Bins ⋮ Offline black and white bin packing ⋮ Online bin packing with \((1,1)\) and \((2,R)\) bins
This page was built for publication: An APTAS for Generalized Cost Variable-Sized Bin Packing
