Computing, Telecommunication and Control Информатика, телекоммуникации и управление 2687-0517 20 A modification of branch-and-bound method for optimal solution of the 1-D packing problem of rectangular-oriented structure Модификация метода ветвей и границ для поиска оптимального решения задачи одномерной упаковки прямоугольно-ориентированной структуры Mesyagutov Marat marat.mesyagutov@googlemail.com 10 06 2010 3 101 130 134

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.

 1-D rectangular-oriented packing branch-and-bound method linear programming