A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
From MaRDI portal
Publication:652857
DOI10.1016/j.mcm.2011.04.003zbMath1228.90156OpenAlexW2037068211MaRDI QIDQ652857
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
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (8)
Gender differences in ambiguity aversion under different outcome correlation structures ⋮ Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Stake effects on ambiguity attitudes for gains and losses ⋮ Common consequence effects in pricing and choice ⋮ Fast heuristic for constrained homogenous T-shape cutting patterns ⋮ Unnamed Item ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
Cites Work
- Unnamed Item
- An exact algorithm for generating homogeneous T-shape cutting patterns
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Exact solutions for constrained two-dimensional cutting problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- Generating optimal two-section cutting patterns for rectangular blanks
- Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- 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
This page was built for publication: A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
