1 |
Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. (1992), Proof verification and hardness of approximation problems, in Proceedings of the 33rd IEEE Symposium on the Foundations of Computer Science, 14-23.
|
2 |
Caprara, A. and Toth, P. (2001), Lower bounds and algorithms for the 2-dimensional vector packing problem, Discrete Applied Mathematics, 111, 231-262.
DOI
|
3 |
Chang, S. Y., Hwang, H.-C., and Park, S. (2005), A two-dimensional vector packing model for the efficient use of coil cassettes, Computers and Operations Research, 32, 2051-2058.
DOI
|
4 |
Chekuri, C. (1998), Approximation Algorithms for Scheduling Problems, PhD. Thesis, Stanford University, Department of Computer Science.
|
5 |
Coffman Jr., E. G., Garey, M. R., and Johnson D. S. (1997), Approximation algorithms for bin packing: A survey, in D. S. Hochbaum, eds. : Approximation Algorithms for NPhard Problems, PWS Publishing Company.
|
6 |
Fernandez de la Vega, W. and Lueker, G. S. (1981), Bin packing can be solved within in linear time, Combinatorics, 1, 349-355.
DOI
|
7 |
Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability : a Guide to the Theory of NP-Completeness, Freeman, San Francisco.
|
8 |
Hwang, H.-C. (2007), A 4/3-Approximation Algorithm for Cassette Packing in Steel Industry, Asia-Pacific Journal of Operational Research, 24, 715-724.
DOI
|
9 |
Johnson, D. S. (1973), Near-Optimal Bin Packing Algorithms, PhD thesis, Massachusetts Institute of Technology, Department of Mathematics, Cambridge, MA.
|
10 |
Kann, V. (1991), Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters, 38, 27-35.
|
11 |
Kellerer, H. and Kotov, V. (2003), An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing, Operations Research Letters, 31, 35- 41.
DOI
|
12 |
Papadimitriou, C. H. and Yannakakis, M. (1991), Optimization, approximation and complexity classes, Journal of Computer and System Sciences, 43, 425-440.
DOI
|
13 |
Spieksma, F. C. R. (1994), A branch-and-bound algorithm for the two dimensional vector packing problem, Computers and Operations Research, 21, 19-25.
DOI
|
14 |
Woeginger, G. J. (1997), There is no asymptotic PTAS for two-dimensional vector packing, Information Processing Letters, 64, 293-297.
DOI
|
15 |
Yao, A. C. C. (1980), New algorithms for bin packing, Journal of the ACM, 27, 207-227.
DOI
|