Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
From MaRDI portal
Publication:2767721
DOI10.1111/1475-3995.00002zbMath0992.90055MaRDI QIDQ2767721
Mike Wright, André R. S. Amaral
Publication date: 30 January 2002
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/1475-3995.00002
algorithm; combinatorial optimization; branch-and-bound algorithms; constrained two-dimensional cutting stock problem
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS, A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem, Heuristic for constrained T-shape cutting patterns of rectangular pieces, A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns, Fast heuristic for constrained homogenous T-shape cutting patterns, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, An exact algorithm for generating homogeneous T-shape cutting patterns, A recursive algorithm for constrained two-dimensional cutting problems, Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns, Simple block patterns for the two-dimensional cutting problem
