An introduction to the two‐dimensional rectangular cutting and packing problem
From MaRDI portal
Publication:6056889
Cites work
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- A Graph-Theoretic Approach to a Class of Integer-Programming Problems
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A guide to vehicle routing heuristics
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting 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 hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A least wasted first heuristic algorithm for the rectangular packing problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A new constraint programming approach for the orthogonal packing problem
- A new exact method for the two-dimensional orthogonal packing problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A Note on the Two-Dimensional Rectangular Cutting-Stock Problem
- A recursive exact algorithm for weighted two-dimensional cutting
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A set-covering-based heuristic approach for bin-packing problems
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- A typology of cutting and packing problems
- Algorithms for the constrained two-staged two-dimensional cutting problem
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An and-or-graph approach for two-dimensional cutting problems
- An application of simulated annealing to the cutting stock problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- An improved typology of cutting and packing problems
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
- Computational Science - ICCS 2004
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Exact solution of the two-dimensional finite bin packing problem
- Exact solution techniques for two-dimensional cutting and packing
- Extreme point-based heuristics for three-dimensional bin packing
- GRASP and path relinking for the two-dimensional two-stage cutting-stock problem
- Guided local search for the three-dimensional bin-packing problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
- Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 5299948 (Why is no real title available?)
- scientific article; zbMATH DE number 710068 (Why is no real title available?)
- scientific article; zbMATH DE number 1488076 (Why is no real title available?)
- scientific article; zbMATH DE number 953063 (Why is no real title available?)
- Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1--2, 2010. Proceedings
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Knowledge based approach to the cutting stock problem
- Modeling two-dimensional guillotine cutting problems via integer programming
- Models and algorithms for three-stage two-dimensional bin packing
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Multistage Cutting Stock Problems of Two and More Dimensions
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- On genetic algorithms for the packing of polygons
- On Packing Two-Dimensional Bins
- Orthogonal Packings in Two Dimensions
- Packing problems
- Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
- Recent advances on two-dimensional bin packing problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Sequential heuristic for the two-dimensional bin-packing problem
- Solution for the constrained Guillotine cutting problem by simulated annealing
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- The G4-Heuristic for the Pallet Loading Problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- The pallet loading problem: a review of solution methods and computational experiments
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- The Theory and Computation of Knapsack Functions
- The Three-Dimensional Bin Packing Problem
- The trim-loss and assortment problems: A survey
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-dimensional packing problems: a survey
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(14)- Grids for cutting and packing problems: a study in the 2D knapsack problem
- 2DPackLib: a two-dimensional cutting and packing library
- L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing
- An improved typology of cutting and packing problems
- scientific article; zbMATH DE number 1225305 (Why is no real title available?)
- Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem
- A new upper bound for unconstrained two-dimensional cutting and packing
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups
- Improved dynamic programming algorithms for unconstrained two-dimensional 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
- On the multiple optimal solutions and patterns of the pallet loading problem
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
- The two-dimensional orthogonal packing problem with item fragmentation: formulation and local search-based algorithms (applications on tank-farm layout planning)
- Hierarchical rectangle packing solved by multi-level recursive logic-based benders decomposition
This page was built for publication: An introduction to the two‐dimensional rectangular cutting and packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6056889)
