A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
From MaRDI portal
Publication:2643948
Recommendations
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
Cites work
- A algorithm for two-dimensional packing
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A typology of cutting and packing problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An analytical model for the container loading problem
- An approach to two-dimensional cutting stock problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An exact algorithm for the pallet loading problem
- An exact approach to the strip-packing problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
- An improved typology of cutting and packing problems
- Average-case analysis of cutting and packing in two dimensions
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Cutting stock problems and solution procedures
- Efficient automated pallet loading
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Models and bounds for two-dimensional level packing problems
- Network flows and non-guillotine cutting patterns
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- On the two-dimensional knapsack problem
- Orthogonal Packings in Two Dimensions
- Packing problems
- Packing small boxes into a big box.
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- Two-dimensional packing problems: a survey
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(35)- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- LP bounds in various constraint programming approaches for orthogonal packing
- MPQ-trees for the orthogonal packing problem
- Conservative scales in packing problems
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Exact solution techniques for two-dimensional cutting and packing
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- An efficient deterministic optimization approach for rectangular packing problems
- MPQ-trees for orthogonal packing problem
- A bi-objective guillotine cutting problem of stamping strips of equal circles
- One-dimensional relaxations and LP bounds for orthogonal packing
- Nonorthogonal Two-Dimensional Cutting Patterns
- The three-dimensional knapsack problem with balancing constraints
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Using dual feasible functions to construct fast lower bounds for routing and location problems
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Mathematical and computational model for the efficient solution of two-dimensional (2D) material cutting problems using integer linear programming
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A survey of dual-feasible and superadditive functions
- The off-line group seat reservation problem
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution
- 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
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Multi-dimensional bin packing problems with guillotine constraints
This page was built for publication: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643948)
