A recursive exact algorithm for weighted two-dimensional cutting
From MaRDI portal
Recommendations
- A recursive algorithm for constrained two-dimensional cutting problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
Cites work
- scientific article; zbMATH DE number 3918092 (Why is no real title available?)
- scientific article; zbMATH DE number 3954634 (Why is no real title available?)
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An and-or-graph approach for two-dimensional cutting problems
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- An improved version of Wang's algorithm for two-dimensional cutting problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Multistage Cutting Stock Problems of Two and More Dimensions
- Packing problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- The Theory and Computation of Knapsack Functions
- Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions
Cited in
(23)- Recursive algorithm for the two‐dimensional cutting problem of punched strips
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- T-shape homogeneous block patterns for the two-dimensional cutting problem
- Simple block patterns for the two-dimensional cutting problem
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- Generating optimal two-section cutting patterns for rectangular blanks
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A two-phase constructive algorithm for the single container mix-loading problem
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- A recursive algorithm for constrained two-dimensional cutting problems
- Exact algorithms for the guillotine strip cutting/packing problem.
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Two-stage general block patterns for the two-dimensional cutting problem
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- An exact algorithm for the knapsack sharing problem
This page was built for publication: A recursive exact algorithm for weighted two-dimensional cutting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278248)
