Exact algorithms for the two-dimensional strip packing problem with and without rotations
From MaRDI portal
Publication:1027586
DOI10.1016/j.ejor.2008.08.020zbMath1163.90803OpenAlexW1973019085MaRDI QIDQ1027586
Koji Nonobe, Mutsunori Yagiura, Takashi Imamichi, Hiroshi Nagamochi, Mitsutoshi Kenmochi
Publication date: 30 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.08.020
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
A hybrid algorithm based on variable neighbourhood for the strip packing problem, A theoretical and experimental study of fast lower bounds for the two-dimensional bin 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, 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, Corner occupying theorem for the two-dimensional integral rectangle packing problem, A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem, Combinatorial Benders' Cuts for the Strip Packing Problem, 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, Routing problems with loading constraints, Exact and approximate methods for the score-constrained packing problem, A new search procedure for the two-dimensional orthogonal packing problem, A squeaky wheel optimisation methodology for two-dimensional strip packing, Scheduling inspired models for two-dimensional packing problems, A skyline heuristic for the 2D rectangular packing and strip packing problems, On packing squares into a rectangle, Metaheuristics for truck loading in the car production industry, The Meet-in-the-Middle Principle for Cutting and Packing Problems, 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, Order and static stability into the strip packing problem, New lower bounds for bin packing problems with conflicts, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, Constructive heuristics for the canister filling problem, Exact solution techniques for two-dimensional cutting and packing, An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem, Upper bounds for heuristic approaches to 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, Irregular packing: MILP model based on a polygonal enclosure
Cites Work
- Unnamed Item
- Unnamed Item
- Reactive GRASP for the strip-packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- On genetic algorithms for the packing of polygons
- Some experiments with simulated annealing techniques for packing problems
- Local search algorithms for the rectangle packing problem with general spatial costs
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- Two-dimensional packing problems: a survey
- Exhaustive approaches to 2D rectangular perfect packings
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- An improved typology of cutting and packing problems
- An Exact Approach to the Strip-Packing Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Handbook of Approximation Algorithms and Metaheuristics
- An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
- Orthogonal Packings in Two Dimensions
- The Three-Dimensional Bin Packing Problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- New heuristic and interactive approaches to 2D rectangular strip packing
