An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem-Reference-Cited by-同舟云学术

An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem

Published:2002 Issue: Volume: Page:315-328
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Caprara Alberto,Lodi Andrea,Monaci Michele

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-47867-1_23

Reference14 articles.

1. B.S. Baker, E.G. Coffman, Jr., and R.L. Rivest. Orthogonal packing in two dimensions. SIAM Journal on Computing, 9:846–855, 1980.

2. B.S. Baker and J.S. Schwartz. Shelf algorithms for two-dimensional packing problems. SIAM Journal on Computing, 12:508–525, 1983.

3. F.R.K. Chung, M.R. Garey, and D.S. Johnson. On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods, 3:66–76, 1982.

4. E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson. Approximation algorithms for bin packing: A survey. In D.S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, 1997.

5. E.G. Coffman, Jr., M.R. Garey, D.S. Johnson, and R.E. Tarjan. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9:801–826, 1980.

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

1. Using the Branch and Bound Method to Solve the Optimal Packaging Problem;2023 International Russian Automation Conference (RusAutoCon);2023-09-10

2. Approximation Algorithms for Multiple Strip Packing;Approximation and Online Algorithms;2010

3. A 3-approximation algorithm for two-dimensional bin packing;Operations Research Letters;2005-03

4. Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing;Mathematics of Operations Research;2005-02