Strip generation algorithms for constrained two-dimensional two-staged cutting problems

DOI10.1016/j.ejor.2004.10.020zbMath1120.90071OpenAlexW2082169059MaRDI QIDQ2490166

Mhand Hifi, Rym M'Hallah

Publication date: 28 April 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.10.020

zbMATH Keywords

Dynamic programmingOptimizationApproximate algorithmsCutting problemsSingle constrained knapsack problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem ⋮ An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container ⋮ Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ Determining the \(K\)-best solutions of knapsack problems ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems ⋮ A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns

Cites Work

• An exact algorithm for large unbounded knapsack problems
• Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
• The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• The cutting stock problem in a hardboard industry: A case study.
• Integer linear programming models for 2-staged two-dimensional knapsack problems
• A typology of cutting and packing problems
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Fast Approximation Algorithms for Knapsack Problems
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• An Algorithm for Two-Dimensional Cutting Problems
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions
• Exact algorithms for large-scale unconstrained two and three staged cutting problems
• Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems