On the generalized bin packing problem

DOI10.1111/itor.12258zbMath1366.90174OpenAlexW3031054753MaRDI QIDQ5278218

Maurizio Bruglieri, Mauro Maria Baldi

Publication date: 13 July 2017

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: http://porto.polito.it/2464182/

zbMATH Keywords

dynamic programmingapproximationbin packing problemBellman's optimality principlevariable cost and size bin packing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items

Algorithmic analysis of priority-based bin packing ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems ⋮ Downward compatible loading optimization with inter-set cost in automobile outbound logistics ⋮ Priority-based bin packing with subset constraints ⋮ Lower bounds for a bin packing problem with linear usage cost

Cites Work

• Unnamed Item
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
• Bin packing with rejection revisited
• Bin packing with fixed number of bins revisited
• Solving the variable size bin packing problem with discretized formulations
• A fast asymptotic approximation scheme for bin packing with rejection
• Bin packing problems with rejection penalties and their dual problems
• AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
• An APTAS for Generalized Cost Variable-Sized Bin Packing
• Variable Sized Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms