In recent years, GPU computing has become an increasingly important tool to develop efficient applications in several areas, including optimization. One of the optimization approaches that seems to take most advantage from GPU computing is dynamic programming. In this paper, we investigate the application of GPU computing to the two-dimensional guillotine cutting problem, solved by dynamic programming. We show a possible implementation and we discuss a number of technical issues. Computational results on test instances available in the literature and on new larger instances show the effectiveness of the dynamic programming approach based on GPU computing for this problem. Data, as supplemental material, are available at http://dx.doi.org/10...
The Dynamic Programming Algorithm (DPA) was developed in the fifties. However, it is sometimes still...
In this paper we present a dynamic programming based technique that is suitable for providing exact ...
We consider a real world generalization of the 2-Dimensional Guillotine Cutting Stock Problem arisin...
We tackle the unconstrained guillotine two-dimensional cutting prob- lem (U2DCP) by a new improved v...
In this paper, a dynamic programming-based recursive method is proposed for solving an unconstrained...
In the unconstrained two-dimensional cutting problems (U2DCP) small rectangular objects have to be e...
We propose a framework to model general guillotine restrictions in two-dimensional cutting problems ...
We propose a framework to model general guillotine restrictions in two-dimensional cutting problems ...
New constructive algorithms for the two-dimensional guillotine-cutting problem are presented. The al...
Neste artigo estudamos um caso particular dos problemas de corte, denominado problema bidimensional ...
In this paper, a heuristic dynamic-programming recursion is proposed for solving unconstrained 2D kn...
Neste artigo estudamos um caso particular dos problemas de corte, denominado problema bidimensional ...
The constrained two-dimensional cutting problem involves maximising the sum of the profits obtained ...
The Dynamic Programming Algorithm (DPA) was developed in the fifties. However, it is sometimes still...
In this paper we present a dynamic programming based technique that is suitable for providing exact ...
We consider a real world generalization of the 2-Dimensional Guillotine Cutting Stock Problem arisin...
We tackle the unconstrained guillotine two-dimensional cutting prob- lem (U2DCP) by a new improved v...
In this paper, a dynamic programming-based recursive method is proposed for solving an unconstrained...
In the unconstrained two-dimensional cutting problems (U2DCP) small rectangular objects have to be e...
We propose a framework to model general guillotine restrictions in two-dimensional cutting problems ...
We propose a framework to model general guillotine restrictions in two-dimensional cutting problems ...
New constructive algorithms for the two-dimensional guillotine-cutting problem are presented. The al...
Neste artigo estudamos um caso particular dos problemas de corte, denominado problema bidimensional ...
In this paper, a heuristic dynamic-programming recursion is proposed for solving unconstrained 2D kn...
Neste artigo estudamos um caso particular dos problemas de corte, denominado problema bidimensional ...
The constrained two-dimensional cutting problem involves maximising the sum of the profits obtained ...
The Dynamic Programming Algorithm (DPA) was developed in the fifties. However, it is sometimes still...
In this paper we present a dynamic programming based technique that is suitable for providing exact ...
We consider a real world generalization of the 2-Dimensional Guillotine Cutting Stock Problem arisin...