A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns

DOI10.1016/J.MCM.2011.04.003MaRDI QIDQ652857zbMATH OpenOpenAlexFDO

Authors Yaodong Cui, Yuli Yang

Publication date 18 December 2011

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2011.04.003

zbMATH Keywords

cutting stockT-shape patternstwo-dimensional cutting

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Fast heuristic for constrained homogenous T-shape cutting patterns
• An exact algorithm for generating homogeneous T-shape cutting patterns
• T-shape homogeneous block patterns for the two-dimensional cutting problem
• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns

Cites work

• A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
• An Algorithm for Two-Dimensional Cutting Problems
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems
• An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
• An exact algorithm for generating homogeneous T-shape cutting patterns
• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• Efficient algorithm for the constrained two-dimensional cutting stock problem
• Exact algorithms for large-scale unconstrained two and three staged cutting problems
• Exact solutions for constrained two-dimensional cutting problems
• Generating optimal two-section cutting patterns for rectangular blanks
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Integer linear programming models for 2-staged two-dimensional knapsack problems
• Setup and open-stacks minimization in one-dimensional stock cutting
• Strip generation algorithms for constrained two-dimensional two-staged cutting problems
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

Cited in

(12)

• Stake effects on ambiguity attitudes for gains and losses
• Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
• Gender differences in ambiguity aversion under different outcome correlation structures
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• Common consequence effects in pricing and choice
• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• scientific article; zbMATH DE number 2084783 (Why is no real title available?)
• An exact rectangular two-segment layout algorithm with optimal same-shape strip generation
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• Fast heuristic for constrained homogenous T-shape cutting patterns
• An exact algorithm for generating homogeneous T-shape cutting patterns
• T-shape homogeneous block patterns for the two-dimensional cutting problem

This page was built for publication: A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652857)