Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem
From MaRDI portal
Publication:2830956
DOI10.1287/ijoc.2016.0693zbMath1348.90501WikidataQ59195714 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
dynamic programming; parallel computing; cutting problems; combinatorial optimization problems; CUDA; GPU computing
90C11: Mixed integer programming
90C47: Minimax problems in mathematical programming
90C15: Stochastic programming
Related Items
Route relaxations on GPU for vehicle routing problems, Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
Uses Software
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