Relations between capacity utilization, minimal bin size and bin number-Reference-Cited by-同舟云学术

Relations between capacity utilization, minimal bin size and bin number

Published:2014-03-15 Issue:1 Volume:217 Page:55-76
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Buchwald Torsten,Hoffmann Kirsten,Scheithauer Guntram

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

http://link.springer.com/content/pdf/10.1007/s10479-014-1572-z.pdf

Reference15 articles.

1. Belov, G., Kartak, V., Rohling, H., & Scheithauer, G. (2009). One-dimensional relaxations and lp bounds for orthogonal packing. International Transactions in Operational Research, 16, 745–766.

2. Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., & Trystram, D. (2009). Approximation algorithm for multiple strip packing. IT University of Copenhagen, Denmark, 7th WAOA.

3. Buchwald, T., & Scheithauer, G., (2012). A note on, Relations between capacity utilization and minimal bin number. Preprint MATH-NM-05-2012, Technische Universität Dresden.

4. Carlier, J., Clautiaux, F., & Moukrim, A. (2007). New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Computers & Operations Research, 34, 2223–2250.

5. Coffman, E. G., Garey, M. R., Johnson, D. S., & Tarjan, R. E. (1980). Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4), 808–826.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two-Dimensional Bin Packing;Introduction to Cutting and Packing Optimization;2017-10-24

2. Upper bounds for heuristic approaches to the strip packing problem;International Transactions in Operational Research;2014-05-30