Learn More
The primary objective in cutting and packing problems is trim loss or material input minimization (in stock cutting) or value maximization (in knapsack-type problems). However, in real-life production we usually have many other objectives (costs) and constraints. Probably the most complex auxiliary criteria of a solution are the number of different cutting(More)
The one-dimensional cutting stock problem (1D-CSP) and the two-dimensional two-stage guillotine constrained cutting problem (2D-2CP) are considered in this paper. The Gilmore-Gomory model of these problems has a very strong continuous relaxation which provides a good bound in an LP-based solution approach. In recent years, there have been several efforts to(More)
We consider two-dimensional rectangular strip packing without rotation of items and without the guillotine cutting constraint. We propose a single-pass heuristic which fills every free space in a one-dimensional knapsack fashion, i.e. considering only item widths. It appears especially important to assign suitable heuristic " pseudo-values " as profits in(More)
The primary objective in cutting and packing problems is trim loss or material input minimization (in stock cutting) or value maximization (when packing into a knapsack). However, in real-life production we usually have many other objectives (costs) and constraints, for example, the number of different patterns. We propose a new simple model for setup(More)