scientific article; zbMATH DE number 7298167

DOI10.6186/IJIMS.201806_29(2).0003zbMath1457.90124MaRDI QIDQ5144816

Jun Ji, Yaodong Cui, Wenzeng Zhang, Fei-Fei Xing

Publication date: 19 January 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programmingpackingcuttingsame-shape striptwo-segment layout

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
• A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
• A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
• Two-stage general block patterns for the two-dimensional cutting problem
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
• A tabu search algorithm for a two-dimensional non-guillotine cutting problem
• Multistage Cutting Stock Problems of Two and More Dimensions
• Exact algorithms for large-scale unconstrained two and three staged cutting problems

This page was built for publication: