A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem

DOI10.1007/978-3-319-42902-1_52MaRDI QIDQ4596237zbMATH OpenOpenAlexFDO

Authors Frederico Dusberger, Günther R. Raidl

Publication date 1 December 2017

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-42902-1_52

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems
• An LP-based approach to a two-stage cutting stock problem
• Models for the two-dimensional two-stage cutting stock problem with multiple stock size
• The two-dimensional cutting stock problem revisited
• A Two-phase Heuristic for the Two-dimensional Cutting-stock Problem
• Efficient algorithm for the constrained two-dimensional cutting stock problem
• An integer programming model for two- and three-stage two-dimensional cutting stock problems
• Algorithms for the one-dimensional two-stage cutting stock problem
• A near-optimal solution to a two-dimensional cutting stock problem

Cited in

(4)

• Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
• A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
• Models for the two-dimensional two-stage cutting stock problem with multiple stock size

This page was built for publication: A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem

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