An Exact Approach to the Strip-Packing Problem
From MaRDI portal
Publication:2884561
DOI10.1287/ijoc.15.3.310.16082zbMath1238.90116OpenAlexW2165033395MaRDI QIDQ2884561
Michele Monaci, Silvano Martello, Daniele Vigo
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.15.3.310.16082
Related Items (79)
A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ Strip packing with precedence constraints and strip packing with release times ⋮ A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints ⋮ A guided tabu search for the vehicle routing problem with two-dimensional loading constraints ⋮ An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ SPEEDUP-AWARE CO-SCHEDULES FOR EFFICIENT WORKLOAD MANAGEMENT ⋮ Robust mixed-integer linear programming models for the irregular strip packing problem ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ An improved typology of cutting and packing problems ⋮ A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem ⋮ A new exact method for the two-dimensional orthogonal packing problem ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ Exhaustive approaches to 2D rectangular perfect packings ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ Single workgroup scheduling problem with variable processing personnel ⋮ Two- and three-dimensional parametric packing ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints ⋮ An exact method for the 2D guillotine strip packing problem ⋮ iGreen: green scheduling for peak demand minimization ⋮ The consecutive multiprocessor job scheduling problem ⋮ A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ Compact integer linear programming formulations for the temporal bin packing problem with fire-ups ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A reference length approach for the 3D strip packing problem ⋮ Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques ⋮ Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ A new search procedure for the two-dimensional orthogonal packing problem ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ Scheduling inspired models for two-dimensional packing problems ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Metaheuristics for truck loading in the car production industry ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ On the two-dimensional knapsack problem ⋮ Minimum tiling of a rectangle by squares ⋮ Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution ⋮ Reactive GRASP for the strip-packing problem ⋮ A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem ⋮ Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning ⋮ Ant colony optimization for the two-dimensional loading vehicle routing problem ⋮ The value of integrating loading and routing ⋮ Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem ⋮ Heuristic approaches for the two- and three-dimensional knapsack packing problem ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing ⋮ Order and static stability into the strip packing problem ⋮ Lower bounds for three-dimensional multiple-bin-size bin packing problems ⋮ A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces ⋮ Bidirectional best-fit heuristic for orthogonal rectangular strip packing ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ Approximability results for the resource-constrained project scheduling problem with a single type of resources ⋮ A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem ⋮ A branch and bound algorithm for the strip packing problem ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints ⋮ Exact algorithms for the two-dimensional strip packing problem with and without rotations ⋮ A branch-and-price algorithm for the two-dimensional level strip packing problem ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ A hybrid metaheuristic for the two-dimensional strip packing problem ⋮ Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Two-dimensional packing problems: a survey ⋮ A branch-and-price algorithm for the temporal bin packing problem ⋮ 2DPackLib: a two-dimensional cutting and packing library
This page was built for publication: An Exact Approach to the Strip-Packing Problem
