An Algorithm for Two-Dimensional Cutting Problems
From MaRDI portal
Publication:4146535
Cited in
(only showing first 100 items - show all)- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- Two-dimensional knapsack-block packing problem
- Instance space analysis for 2D bin packing mathematical models
- Sequential design with applications to the trim-loss problem
- Exact solution techniques for two-dimensional cutting and packing
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- The exact solutions of several types of container loading problems
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Mapping tree-structured combinatorial optimization problems onto parallel computers
- 3-D container packing heuristics
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting
- Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- Stock cutting to minimize cutting length
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- 2DPackLib: a two-dimensional cutting and packing library
- Optimising the cutting of wood fibre plates in the hardboard industry
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A linear optimization approach to the combined production planning model
- Generating optimal two-section cutting patterns for rectangular blanks
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- Improved flow-based formulations for the skiving stock problem
- Classification and literature review of integrated lot-sizing and cutting stock problems
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A block-based layer building approach for the 2D guillotine strip packing problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- An approach to two-dimensional cutting stock problems
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- Composite stock cutting through simulated annealing
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- A simple randomized algorithm for two-dimensional strip packing
- The computer as an aid to physical distribution management
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Modeling two-dimensional guillotine cutting problems via integer programming
- Optimization models for the three-dimensional container loading problem with practical constraints
- Fast heuristic for constrained homogenous T-shape cutting patterns
- Recent advances on two-dimensional bin packing problems
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- The nesting problem in the leather manufacturing industry
- An algorithm for the 2D guillotine cutting stock problem
- The cutting stock problem in a hardboard industry: A case study.
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- Exact algorithms for the two-dimensional guillotine knapsack
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- Computing stable loads for pallets
- A recursive algorithm for constrained two-dimensional cutting problems
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Rectangle packing with a recursive pilot method
- Load planning for shipments of low density products
- A new constraint programming approach for the orthogonal packing problem
- Bun splitting: a practical cutting stock problem
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- The off-line group seat reservation problem
- Reactive GRASP for the strip-packing problem
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- The maximum diversity assortment selection problem
- A branch and bound algorithm for the strip packing problem
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- Combinatorial Benders' cuts for the strip packing problem
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Using GPU computing for solving the two-dimensional guillotine cutting problem
- Exact algorithms for the guillotine strip cutting/packing problem.
- On the two-dimensional knapsack problem
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- Packing problems
- An improved typology of cutting and packing problems
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Exact solutions for constrained two-dimensional cutting problems
- An analytical model for the container loading problem
- The trim-loss and assortment problems: A survey
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- An EDA for the 2D knapsack problem with guillotine constraint
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A branch-and-cut algorithm for the pallet loading problem
- Solution for the constrained Guillotine cutting problem by simulated annealing
This page was built for publication: An Algorithm for Two-Dimensional Cutting Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146535)
