Using GPU computing for solving the two-dimensional guillotine cutting problem
From MaRDI portal
Recommendations
- Solving knapsack problems on GPU
- Megapixel topology optimization on a graphics processing unit
- Efficient GPU-based implementations of simplex type algorithms
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
Cites work
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An Algorithm for Two-Dimensional Cutting Problems
- An improved typology of cutting and packing problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Solving knapsack problems on GPU
- Solving path problems on the GPU
- The Theory and Computation of Knapsack Functions
Cited in
(7)- A fully parallel multi-objective genetic algorithm for optimization of flexible shop floor production performance and schedule stability under dynamic environments
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting
- Parallel branch-and-price algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
- Strip based compact formulation for two-dimensional guillotine cutting problems
- 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
This page was built for publication: Using GPU computing for solving the two-dimensional guillotine cutting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830956)
