Exact Solution of the Two-Dimensional Finite Bon Packing Problem
Management Science
A lower bound for the non-oriented two-dimensional bin packing problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Computers and Operations Research
Bidimensional packing by bilinear programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
Operations Research
Computers and Operations Research
New fast heuristics for the 2d strip packing problem with guillotine constraint
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Computers and Operations Research
Comparing several heuristics for a packing problem
International Journal of Advanced Intelligence Paradigms
Hi-index | 0.00 |
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous results. Computational experiments show that the bounds are tight. We also discuss the case where the bin is not a square.