Approximation algorithms for the orthogonal z-oriented three-dimensional packing problem

SIAM Journal on Computing

Volumn 29, Issue 3, 1999, Pages 1008-1029

  Miyazawa, F K ^a   Wakabayashi, Y ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; PACKAGING; PROBLEM SOLVING; THEOREM PROVING; THREE DIMENSIONAL;

APPROXIMATION ALGORITHMS; ASYMPTOTIC PERFORMANCE BOUND; THREE DIMENSIONAL PACKING;

APPROXIMATION THEORY;

EID: 0033296774     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s009753979631391x     Document Type: Article

References (6)

1. B. S. BAKER, D. J. BROWN, AND H. P. KATSEFF, A 5/4 algorithm for two-dimensional packing, J. Algorithms, 2 (1981), pp. 348-368.
2. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
3. K. LI AND K.-H. CHENG, On three-dimensional packing, SIAM J. Comput., 19 (1990), pp. 847-867.
4. K. LI AND K.-H. CHENG, Static job scheduling in partitionable mesh connected systems, J. Parallel and Distributed Computing, 10 (1990), pp. 152-159.
5. K. LI AND K.-H. CHENG, Heuristic algorithms for on-line packing in three dimensions, J. Algorithms, 13 (1992), pp. 589-605.
6. F. K. MIYAZAWA AND Y. WAKABAYASHI, An algorithm for the three-dimensional packing problem with asymptotic performance analysis, Algorithmica, 18 (1997), pp. 122-144.