A modification of branch-and-bound method for optimal solution of the 1-D packing problem of rectangular-oriented structure

Modelling: Methods, Algorithms, Technologies

The 1D rectangular-oriented packing problem is considered. For its solution we propose a branch-and-bound method with usage of «next fit» rule and bounds based on the auxiliary linear programming problem.