Abstract
We propose and motivate a new variant of the wellknown two-dimensional binpacking problem (orthogonal and oriented rectangle packing). In our model, we are allowed to cut a rectangle and move the parts horizontally. We describe two relatively simple algorithms for this problem and determine their asymptotic performance ratios. For the best algorithm, we show that this ratio is between 1.302.. and 4/3.
Cite
CITATION STYLE
Høyland, S. O. (1988). Bin-packing in 1.5 dimension. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 318 LNCS, pp. 129–137). Springer Verlag. https://doi.org/10.1007/3-540-19487-8_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
