Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
New heuristic and interactive approaches to 2D rectangular strip packing
Journal of Experimental Algorithmics (JEA)
Strip packing with precedence constraints and strip packing with release times
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Two- and three-dimensional parametric packing
Computers and Operations Research
Reactive GRASP for the strip-packing problem
Computers and Operations Research
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Computers and Operations Research
Collaboration Between Hyperheuristics to Solve Strip-Packing Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Ant colony optimization for the two-dimensional loading vehicle routing problem
Computers and Operations Research
Heuristic approaches for the two- and three-dimensional knapsack packing problem
Computers and Operations Research
A least wasted first heuristic algorithm for the rectangular packing problem
Computers and Operations Research
Offline and online aspects of defragmenting the module layout of a partially reconfigurable device
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A Tabu Search Algorithm with Direct Representation for Strip Packing
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems
Engineering Applications of Artificial Intelligence
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems
Engineering Applications of Artificial Intelligence
A memetic algorithm and a parallel hyperheuristic island-based model for a 2D packing problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Strip packing with precedence constraints and strip packing with release times
Theoretical Computer Science
An evolutionary hyperheuristic to solve strip-packing problems
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
A squeaky wheel optimisation methodology for two-dimensional strip packing
Computers and Operations Research
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
Operations Research
Automation and Remote Control
Tabu search with consistent neighbourhood for strip packing
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem
INFORMS Journal on Computing
Computers and Operations Research
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing
Computers and Operations Research
A fast layer-based heuristic for non-guillotine strip packing
Expert Systems with Applications: An International Journal
Parallel island-based multiobjectivised memetic algorithms for a 2D packing problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
LP bounds in various constraint programming approaches for orthogonal packing
Computers and Operations Research
A SAT encoding for multi-dimensional packing problems
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
On the two-dimensional Knapsack Problem
Operations Research Letters
A simple randomized algorithm for two-dimensional strip packing
Computers and Operations Research
Planning in logistics: a survey
Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop
A Reinforced Tabu Search Approach for 2D Strip Packing
International Journal of Applied Metaheuristic Computing
A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem
International Journal of Applied Metaheuristic Computing
Expert Systems with Applications: An International Journal
A New Graph-Theoretical Model for the Guillotine-Cutting Problem
INFORMS Journal on Computing
INFORMS Journal on Computing
Online scheduling for multi-core shared reconfigurable fabric
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Hybrid approach for 2d strip packing problem using genetic algorithm
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I
Journal of Global Optimization
| Hi-index | 0.00 |
We consider the problem of orthogonally packing a given set of rectangular items into a given strip, by minimizing the overall height of the packing. The problem is NP-hard in the strong sense, and finds several applications in cutting and packing. We propose a new relaxation that produces good lower bounds and gives information to obtain effective heuristic algorithms. These results are used in a branch-and-bound algorithm, which was able to solve test instances from the literature involving up to 200 items.