Upper bounds and algorithms for the maximum cardinality bin packing problem.

DOI10.1016/S0377-2217(02)00466-6zbMath1033.90108OpenAlexW1965367287MaRDI QIDQ1399594

Silvano Martello, Martine Labbé, Gilbert Laporte

Publication date: 30 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00466-6

zbMATH Keywords

dual bin packingMaximum cardinality bin packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Improved filtering for the bin-packing with cardinality constraint, Packing items to feed assembly lines, An improved typology of cutting and packing problems, Models and complexity of multibin packing problems, Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver, Lower bounds and algorithms for the minimum cardinality bin covering problem, Mathematical models and decomposition methods for the multiple knapsack problem, A branch-and-bound algorithm for hard multiple knapsack problems

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds and reduction procedures for the bin packing problem
• Probabilistic bounds for dual bin-packing
• Bin packing: Maximizing the number of pieces packed
• Heuristic algorithms for the multiple knapsack problem
• Probabilistic analysis of a heuristic for the dual bin packing problem
• An exact algorithm for the dual bin packing problem
• Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
• Solving Multiple Knapsack Problems by Cutting Planes