Exact solutions for constrained two-dimensional cutting problems

DOI10.1016/0377-2217(95)00028-OzbMath0912.90237OpenAlexW2078925004MaRDI QIDQ1127220

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

zbMATH Keywords

trim lossintelligent searchconstrained two-dimensional cutting

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns, An exact algorithm for generating homogeneous T-shape cutting patterns, An integrated cutting stock and sequencing problem, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais, Solution for the constrained Guillotine cutting problem by simulated annealing, A recursive algorithm for constrained two-dimensional cutting problems, Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems

Cites Work

• The trim-loss and assortment problems: A survey
• An and-or-graph approach for two-dimensional cutting problems
• An improved version of Wang's algorithm for two-dimensional cutting problems
• A typology of cutting and packing problems
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Algorithm for Two-Dimensional Cutting Problems
• The Theory and Computation of Knapsack Functions
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• Unnamed Item