An exact method for the 2D guillotine strip packing problem
DOI10.1155/2009/732010zbMATH Open1198.90333DBLPjournals/advor/BekrarK09OpenAlexW2074218164WikidataQ58647095 ScholiaQ58647095MaRDI QIDQ606187FDOQ606187
Publication date: 16 November 2010
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/224978
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Packing Two-Dimensional Bins
- Exact algorithms for the guillotine strip cutting/packing problem.
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- The two-dimensional bin packing problem with variable bin sizes and costs
- An exact approach to the strip-packing problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- A new exact method for the two-dimensional orthogonal packing problem
- An analytical model for the container loading problem
- Lower bounds and reduction procedures for the bin packing problem
- Models and bounds for two-dimensional level packing problems
- Exhaustive approaches to 2D rectangular perfect packings
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A new constraint programming approach for the orthogonal packing problem
- An approximation scheme for strip packing of rectangles with bounded dimensions
Cited In (11)
- Exact solution of the 2-dimensional grid arrangement problem
- Strip based compact formulation for two-dimensional guillotine cutting problems
- Solving the irregular strip packing problem via guided local search for overlap minimization
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- A linear programming approach for the three-dimensional bin-packing problem
- Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem
- Queue-constrained packing: a vehicle ferry case study
- Exact algorithms for the guillotine strip cutting/packing problem.
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
This page was built for publication: An exact method for the 2D guillotine strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606187)
