Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 147-164
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problemEuropean Journal of Operational Research, 2006
- Weight annealingPhysica A: Statistical Mechanics and its Applications, 2005
- Upper bounds and algorithms for the maximum cardinality bin packing problemEuropean Journal of Operational Research, 2003
- New heuristics for one-dimensional bin-packingComputers & Operations Research, 2002
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem1999
- Solving Multiple Knapsack Problems by Cutting PlanesSIAM Journal on Optimization, 1996
- Lower bounds and reduction procedures for the bin packing problemDiscrete Applied Mathematics, 1990
- Bin packing: Maximizing the number of pieces packedActa Informatica, 1978