Order and static stability into the strip packing problem
From MaRDI portal
Publication:2259026
DOI10.1007/s10479-014-1634-2zbMath1306.90124OpenAlexW1970066921MaRDI QIDQ2259026
Flávio K. Miyazawa, Thiago Alves de Queiroz
Publication date: 27 February 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1634-2
integer programmingtwo-dimensional strip packing problemorder constraintcargo stabilitystatic equilibrium of rigid bodies
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories ⋮ The static stability of support factor‐based rectangular packings: an assessment by regression analysis ⋮ The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids ⋮ Cargo securing under multi-drop and axle weight constraints ⋮ Models and algorithms for optimising two-dimensional LEGO constructions ⋮ Exact solution techniques for two-dimensional cutting and packing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact strip packing algorithm based on canonical forms
- A hybrid placement strategy for the three-dimensional strip packing problem
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Reactive GRASP for the strip-packing problem
- Computing stable loads for pallets
- 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
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Exact algorithms for the guillotine strip cutting/packing problem.
- MIP-based approaches for the container loading problem with multi-drop constraints
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Models and bounds for two-dimensional level packing problems
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Exhaustive approaches to 2D rectangular perfect packings
- An improved typology of cutting and packing problems
- An Exact Approach to the Strip-Packing Problem
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- Bin packing with discrete item sizes, part II: Tight bounds on First Fit
- Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms
- An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
This page was built for publication: Order and static stability into the strip packing problem
