An APTAS for Generalized Cost Variable-Sized Bin Packing

DOI10.1137/060670328MaRDI QIDQ3614165zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Asaf Levin

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

zbMATH Keywords

approximation algorithmbin packingworst-case analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Variable Sized Bin Packing
• Bin packing with general cost structures
• An AFPTAS for variable sized bin packing with general activation costs
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• Algorithms for the variable sized bin packing problem

Cited in

(20)

• Approximation schemes for the generalized extensible bin packing problem
• Bin packing with general cost structures
• Vector bin packing with multiple-choice
• On the generalized bin packing problem
• Security-aware database migration planning
• Lower bounds for a bin packing problem with linear usage cost
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• Online bin packing with \((1,1)\) and \((2,R)\) bins
• Offline black and white bin packing
• Lower bounds for three-dimensional multiple-bin-size bin packing problems
• Optimal energy-efficient placement of virtual machines with divisible sizes
• The freight consolidation and containerization problem
• An AFPTAS for variable sized bin packing with general activation costs
• The entropy rounding method in approximation algorithms
• An improved approximation scheme for variable-sized bin packing
• Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
• An improved approximation scheme for variable-sized bin packing
• Online Bin Packing with (1,1) and (2,R) Bins
• Truthful mechanism design for bin packing with applications on cloud computing
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts

This page was built for publication: An APTAS for Generalized Cost Variable-Sized Bin Packing

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