Bin‐packing problem with concave costs of bin utilization

DOI10.1002/nav.20142zbMath1151.90588OpenAlexW2068892231MaRDI QIDQ5438528

Chung-Lun Li, Zhi-Long Chen

Publication date: 23 January 2008

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20142

zbMATH Keywords

concavityworst-case analysisbin packing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (10)

Online bin packing with overload cost ⋮ 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 ⋮ Bin packing with general cost structures ⋮ An asymptotic approximation scheme for the concave cost bin packing problem ⋮ 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 ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ Bin packing problem with conflicts and item fragmentation

This page was built for publication: Bin‐packing problem with concave costs of bin utilization