|
|||||
|
|
Packing of one-dimensional bins with contiguous selection of identical items: An exact method of optimal solution |
|
| Authors: | M A Mesyagutov E A Mukhacheva G N Belov G Scheithauer |
| Affiliation: | (1) Department of Computer Science, Ben-Gurion University of the Negev, 84105 Beer-Sheva, Israel;(2) Department of Communication Systems Engineering, Ben-Gurion University of the Negev, 84105 Beer-Sheva, Israel;(3) Computer Science Division, The Open University of Israel, 43107 Raanana, Israel;(4) Department of Computer Science, University of Calgary, Calgary, AB, T2N 1N4, Canada;; |
| Abstract: | Consideration was given to the one-dimensional bin packing problem under the conditions for heterogeneity of the items put into bins and contiguity of choosing identical items for the next bin. The branch-and-bound method using the “next fit” principle and the “linear programming” method were proposed to solve it. The problem and its solution may be used to construct an improved lower bound in the problem of two-dimensional packing. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |