Recursive Computational Procedure for Two-dimensional Stock Cutting
From MaRDI portal
Cited in
(90)- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- Two-dimensional knapsack-block packing problem
- Cutting and packing problems with placement constraints
- Exact solution techniques for two-dimensional cutting and packing
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- The exact solutions of several types of container loading problems
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting
- Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
- Strip based compact formulation for two-dimensional guillotine cutting problems
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- Optimising the cutting of wood fibre plates in the hardboard industry
- Simple block patterns for the two-dimensional cutting problem
- 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
- A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
- 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
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids
- The computer as an aid to physical distribution management
- Modeling two-dimensional guillotine cutting problems via integer programming
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- The cutting stock problem in a hardboard industry: A case study.
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- Computing stable loads for pallets
- Bun splitting: a practical cutting stock problem
- Determining an upper bound for a class of rectangular packing problems
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- 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
- A new search procedure for the two-dimensional orthogonal packing 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
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- An efficient approach for the multi-pallet loading problem
- Solution procedures for cutting lumber into furniture parts
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- 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
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- A branch-and-cut algorithm for the pallet loading problem
- Solving container loading problems by block arrangement
- EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- The pallet loading problem: a review of solution methods and computational experiments
- On the effectivity of gradient methods for cutting stock problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Exploiting packing components in general-purpose integer programming solvers
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- 4-block heuristic for the rectangle packing problem
- Exact methods for the split delivery vehicle routing problem with two-dimensional loading constraints
- An and-or-graph approach for two-dimensional cutting problems
- Knowledge based approach to the cutting stock problem
- A recursive exact algorithm for weighted two-dimensional cutting
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Network flows and non-guillotine cutting patterns
- The pallet packing problem for non-uniform box sizes
- An integrated cutting stock and sequencing problem
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- A new branch-and-cut approach for integrated planning in additive manufacturing
This page was built for publication: Recursive Computational Procedure for Two-dimensional Stock Cutting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5681831)
