An asymptotic approximation scheme for the concave cost bin packing problem

DOI10.1016/j.ejor.2007.08.031zbMath1147.90023OpenAlexW2079096352MaRDI QIDQ933537

Joseph Y.-T. Leung, Chung-Lun Li

Publication date: 21 July 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/1845

zbMATH Keywords

concavitybin packingasymptotic worst-case analysis

Mathematics Subject Classification ID

Operations research and management science (90B99)

Related Items (6)

An AFPTAS for variable sized bin packing with general activation costs ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ Optimal Partitioning Which Maximizes the Weighted Sum of Products ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function

Cites Work

• Bin packing can be solved within 1+epsilon in linear time
• Algorithms for the variable sized bin packing problem
• Computing the asymptotic worst-case of bin packing lower bounds
• Accelerating column generation for variable sized bin-packing problems
• The Ordered Open-End Bin-Packing Problem
• Bin‐packing problem with concave costs of bin utilization

This page was built for publication: An asymptotic approximation scheme for the concave cost bin packing problem