An improved approximation scheme for variable-sized bin packing

DOI10.1007/978-3-642-32589-2_47MaRDI QIDQ2912752zbMATH OpenOpenAlexFDO

Authors Stefan Kraft, Klaus Jansen

Publication date 25 September 2012

Published in Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32589-2_47

zbMATH Keywords

bin packingintegrality gapvariable-sized bin packingAFPTASasymptotic fully polynomial approximation scheme

Mathematics Subject Classification ID

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

Recommendations

• An improved approximation scheme for variable-sized bin packing
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• Variable Sized Bin Packing
• An APTAS for Generalized Cost Variable-Sized Bin Packing
• AFPTAS results for common variants of bin packing: a new method for handling the small items

Cited in

(9)

• A two-phase algorithm for bin stretching with stretching factor 1.5
• Improved Approximation for Vector Bin Packing
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• Efficient algorithms for the offline variable sized bin-packing problem
• Variable sized bin packing with color constraints
• An AFPTAS for variable sized bin packing with general activation costs
• An improved approximation scheme for variable-sized bin packing
• A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
• AFPTAS results for common variants of bin packing: a new method for handling the small items

This page was built for publication: An improved approximation scheme for variable-sized bin packing

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