Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
From MaRDI portal
Cited in
(83)- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Strip based compact formulation for two-dimensional guillotine cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- 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
- Irregular polyomino tiling via integer programming with application in phased array antenna design
- 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
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- Modeling two-dimensional guillotine cutting problems via integer programming
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- The nesting problem in the leather manufacturing industry
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- An algorithm for the 2D guillotine cutting stock problem
- Exact algorithms for the two-dimensional guillotine knapsack
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- 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
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
- Interactive procedures in large-scale two-dimensional cutting stock problems
- Cutting stock problems and solution procedures
- The off-line group seat reservation problem
- The maximum diversity assortment selection problem
- An algorithm for the two-dimensional assortment problem
- Exact algorithms for the guillotine strip cutting/packing problem.
- On the two-dimensional knapsack problem
- Packing problems
- Relaxation techniques applied to some loading problems
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- An improved typology of cutting and packing problems
- Solution procedures for cutting lumber into furniture parts
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Exact solutions for constrained two-dimensional cutting problems
- A data-driven approach for mixed-case palletization with support
- An analytical model for the container loading problem
- 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
- Solution for the constrained Guillotine cutting problem by simulated annealing
- An improved version of Wang's algorithm for two-dimensional cutting problems written by J. F. Oliveira and J. S. Ferraira
- An improved version of Wang's algorithm for two-dimensional cutting problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- 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
- Fixed charge problems with identical fixed charges
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- An effective quasi-human based heuristic for solving the rectangle packing problem
- On the effectivity of gradient methods for cutting stock problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Multi-dimensional bin packing problems with guillotine constraints
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- An efficient deterministic heuristic for two-dimensional rectangular packing
- An exact algorithm for generating homogeneous T-shape cutting patterns
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- Limiting the number of each piece in two-dimensional cutting stock patterns
- Knowledge based approach to the cutting stock problem
- 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
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Solving the pallet loading problem
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- An enumeration scheme to generate constrained exact checkerboard patterns
- The pallet packing problem for non-uniform box sizes
- An integrated cutting stock and sequencing problem
- A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM
- Two-dimensional cutting stock problem with flexible length and usable leftovers in the steel industry
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
This page was built for publication: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3666624)
