An Algorithm for Two-Dimensional Cutting Problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A branch and bound algorithm for the strip packing problem
- A recursive algorithm for constrained two-dimensional cutting problems
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Trim-loss pattern rearrangement and its relevance to the flat-glass industry
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An approximation algorithm for solving unconstrained 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
- An and-or-graph approach for two-dimensional cutting problems
- Composite stock cutting through simulated annealing
- Limiting the number of each piece in two-dimensional cutting stock patterns
- Knowledge based approach to the cutting stock problem
- Packing problems
- Solution for the constrained Guillotine cutting problem by simulated annealing
- Stock cutting to minimize cutting length
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- A recursive exact algorithm for weighted two-dimensional cutting
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- An algorithm for the 2D guillotine cutting stock problem
- On the effectivity of gradient methods for cutting stock problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- The cutting stock problem in a hardboard industry: A case study.
- Exact algorithms for the guillotine strip cutting/packing problem.
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- Approximate algorithms for constrained circular cutting problems
- On the two-dimensional knapsack problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- MIP-based approaches for the container loading problem with multi-drop constraints
- Exact algorithms for the two-dimensional guillotine knapsack
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- An efficient deterministic heuristic for two-dimensional rectangular packing
- A branch-and-cut algorithm for the pallet loading problem
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Lumber production optimization
- An exact algorithm for the pallet loading problem
- An improved version of Wang's algorithm for two-dimensional cutting problems
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- Optimal solutions for the cutting stock problem
- Load planning for shipments of low density products
- A population heuristic for constrained two-dimensional non-guillotine cutting
- The nesting problem in the leather manufacturing industry
- Two-dimensional knapsack-block packing problem
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Exact solution techniques for two-dimensional cutting and packing
- The maximum diversity assortment selection problem
- A hybrid metaheuristic for the two-dimensional strip packing problem
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- 2DPackLib: a two-dimensional cutting and packing library
- Heuristics for packing semifluids
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- The exact solutions of several types of container loading problems
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Improved flow-based formulations for the skiving stock problem
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Solving the pallet loading problem
- An EDA for the 2D knapsack problem with guillotine constraint
- A new constraint programming approach for the orthogonal packing problem
- An enumeration scheme to generate constrained exact checkerboard patterns
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- 3-D container packing heuristics
- Generating optimal two-section cutting patterns for rectangular blanks
- An improved typology of cutting and packing problems
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- The one dimensional Compartmentalised Knapsack problem: a case study
- A new exact method for the two-dimensional orthogonal packing problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- An integrated cutting stock and sequencing problem
- Optimising the cutting of wood fibre plates in the hardboard industry
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- The pallet loading problem: a review of solution methods and computational experiments
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- Using GPU computing for solving the two-dimensional guillotine cutting problem
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Combinatorial Benders' cuts for the strip packing problem
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- Modeling two-dimensional guillotine cutting problems via integer programming
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)
