Algorithms for the constrained two-staged two-dimensional cutting problem

DOI10.1287/IJOC.1070.0233MaRDI QIDQ2901006zbMATH OpenOpenAlexFDO

Authors Mhand Hifi, Rym M'Hallah, Toufik Saadi

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1070.0233

zbMATH Keywords

integer programmingcutting stockdeterministic dynamic programming

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Integer programming (90C10)

Recommendations

• An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
• A cooperative algorithm for constrained two-staged two-dimensional cutting problems
• A recursive algorithm for constrained two-dimensional cutting problems
• Efficient algorithm for the constrained two-dimensional cutting stock problem
• Strip generation algorithms for constrained two-dimensional two-staged cutting problems
• A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
• Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
• Algorithms for the one-dimensional two-stage cutting stock problem
• Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
• Exact algorithms for large-scale unconstrained two and three staged cutting problems

Cited in

(18)

• Exact solutions for constrained two-dimensional cutting problems
• A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
• Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• Strip generation algorithms for constrained two-dimensional two-staged cutting problems
• A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
• Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
• Algorithms for 2-Route Cut Problems
• Efficient algorithms for the offline variable sized bin-packing problem
• A cooperative algorithm for constrained two-staged two-dimensional cutting problems
• A hybrid beam search looking-ahead algorithm for the circular packing problem
• Algorithms for the one-dimensional two-stage cutting stock problem
• GRASP and path relinking for the two-dimensional two-stage cutting-stock problem
• Recursive algorithm for the two‐dimensional cutting problem of punched strips
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• An introduction to the two‐dimensional rectangular cutting and packing problem
• An and-or-graph approach for two-dimensional cutting problems
• An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems

This page was built for publication: Algorithms for the constrained two-staged two-dimensional cutting problem

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