Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem

DOI10.1287/ijoc.2016.0693zbMath1348.90501OpenAlexW2467671100WikidataQ59195714 ScholiaQ59195714MaRDI QIDQ2830956

Vittorio Maniezzo, Francesco Strappaveccia, Marco Antonio Boschetti

Publication date: 1 November 2016

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

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

zbMATH Keywords

dynamic programmingparallel computingcutting problemscombinatorial optimization problemsCUDAGPU computing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Stochastic programming (90C15)

Related Items (4)

Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Route relaxations on GPU for vehicle routing problems ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems

Uses Software

• CUDA
• CUDASW++

Cites Work

• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• Solving path problems on the GPU
• Solving knapsack problems on GPU
• An improved typology of cutting and packing problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Algorithm for Two-Dimensional Cutting Problems
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions
• Recursive Computational Procedure for Two-dimensional Stock Cutting

This page was built for publication: Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem