Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Exact Solution of the Two-Dimensional Finite Bon Packing Problem
Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
New Classes of Lower Bounds for Bin Packing Problems
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
New lower bounds for the three-dimensional finite bin packing problem
Discrete Applied Mathematics
New heuristic and interactive approaches to 2D rectangular strip packing
Journal of Experimental Algorithmics (JEA)
Computers and Operations Research
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
INFORMS Journal on Computing
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Operations Research
A new constraint programming approach for the orthogonal packing problem
Computers and Operations Research
Reactive GRASP for the strip-packing problem
Computers and Operations Research
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers
Bin packing with items uniformly distributed over intervals [a,b]
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
An Exact Algorithm for Higher-Dimensional Orthogonal Packing
Operations Research
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem
INFORMS Journal on Computing
A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
INFORMS Journal on Computing
Computers and Operations Research
Recursive computational procedure for two-dimensional stock cutting
IBM Journal of Research and Development
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
Information Processing Letters
A new exact method for the two-dimensional bin-packing problem with fixed orientation
Operations Research Letters
A new lower bound for the non-oriented two-dimensional bin-packing problem
Operations Research Letters
Conservative scales in packing problems
OR Spectrum
Expert Systems with Applications: An International Journal
A Lagrangian heuristic for sprint planning in agile software development
Computers and Operations Research
| Hi-index | 0.00 |
This paper considers the two-dimensional strip-packing problem (2SP) in which a set of rectangular items have to be orthogonally packed, without overlapping, into a strip of a given width and infinite height by minimizing the overall height of the packing. The 2SP is NP-hard in the strong sense and finds many practical applications. We propose reduction procedures, lower and upper bounds, and an exact algorithm for the 2SP. The new lower bounds are both combinatorial bounds and bounds derived from different relaxations of mathematical formulations of the 2SP. The new upper bounds are obtained by constructive heuristics based on different strategies to place the items into the strip. The new exact method is based on a branch-and-bound approach. Computational results on different sets of test problems derived from the literature show the effectiveness of the new lower and upper bounds and of the new exact algorithm.