An exact rectangular two-segment layout algorithm with optimal same-shape strip generation
From MaRDI portal
Recommendations
- A recursive heuristic algorithm for 2D rectangular strip packing problems
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem
- Computational Science – ICCS 2005
- An optimal algorithm for rectangle placement
Cites work
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Two-stage general block patterns for the two-dimensional cutting problem
Cited in
(4)- Exact algorithm for generating two-segment cutting patterns of punched strips
- An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem
- Data set generation for rectangular placement problems
- Efficient overlap detection and construction algorithms for the bitmap shape packing problem
This page was built for publication: An exact rectangular two-segment layout algorithm with optimal same-shape strip generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144816)
