Exact solutions for constrained two-dimensional cutting problems
From MaRDI portal
Publication:1127220
DOI10.1016/0377-2217(95)00028-OzbMATH Open0912.90237OpenAlexW2078925004MaRDI QIDQ1127220FDOQ1127220
Authors: S. H. Smith 
Publication date: 5 November 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00028-o
Recommendations
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- Exact solution techniques for two-dimensional cutting and packing
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- A recursive algorithm for constrained two-dimensional cutting problems
- Algorithms for the constrained two-staged two-dimensional cutting problem
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- An approach to two-dimensional cutting stock problems
- A near-optimal solution to a two-dimensional cutting stock problem
- Exact approaches for the cutting path determination problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
Cites Work
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- A typology of cutting and packing problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- The trim-loss and assortment problems: A survey
- The Theory and Computation of Knapsack Functions
- Title not available (Why is that?)
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- An improved version of Wang's algorithm for two-dimensional cutting problems
- An and-or-graph approach for two-dimensional cutting problems
Cited In (20)
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock 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
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- A recursive algorithm for constrained two-dimensional cutting problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- 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
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
- An exact algorithm for generating homogeneous T-shape cutting patterns
- An and-or-graph approach for two-dimensional cutting problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- An integrated cutting stock and sequencing problem
- Efficient algorithm for the constrained two-dimensional cutting stock problem
This page was built for publication: Exact solutions for constrained two-dimensional cutting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127220)
