Multi-tiered algorithms for 2-dimensional bin packing

Proceedings of the 5th Distributed Memory Computing Conference, DMCC 1990

Volumn 1, Issue , 1990, Pages 58-63

  Fenrich, R ^a   Miller, R ^a   Stout, Q F ^b  

^a UNIVERSITY AT BUFFALO   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE;

ACTIVE NODE; BEST FIT ALGORITHM; BIN PACKING; HYPERCUBE MULTIPROCESSORS; LEVEL ALGORITHMS; MULTI-TIERED; OPTIMIZATION PROBLEMS; RUNNING TIME;

APPROXIMATION ALGORITHMS;

EID: 85013580724     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DMCC.1990.555362     Document Type: Conference Paper

References (13)

1. E.G. CofGnan, Jr., M.R. Garey, and D.S. Johnson, A p proximation algorithms for bin-packing-An updated survey, Bell Laboratories, Murray Hill, New Jereey, Tedlnical Report, 1988. (This is an update of [TI.)
2. E.G. Coffman, Jr., M.R. Garey, D.S. Johnson, and R.E. Tarjan, Performance bounds for level-orientcd two-dimensional packing algorithms, SIAM J. Comput., 1980, pp. 80b826.
3. E. Cohen and R. Miller, Hypercube algorithms for the multiprocessor scheduling problem, Supercomputer (27), vol. V, no. 5, September, 1988, pp. 17-32.
4. R. Fenrich, R. Miller, and Q. Stout, Hypercube Algorithms for some NP-Hard Packing Problems, Proceedings of the Fourth Conference on Hypercube Concurrent Computers and Applications, 1989, to appear.
5. E.W. Felten, Best-first branch-and-bound on a hypercube, Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, 1988, pp. 1500-1504.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory o j NPCompleteness, W.H. Freeman and Co., San Francisco, 1979.
7. M.R. Garey and D.S. Johnson, Approximation algrithms for bin-packing-A survey, in Analysis and Design of Algorithms in Combinatorial Optimization, C. Ausiello and M. Lucertini (ed), Springer-Verlag, New York, 1981, pp. 147-172.
8. R.L. Graham, The combinatorial mathematics of scheduling, Scientific American, Mar. 1978. pp. 124-132.
9. D.E. Knuth, The Ari of Computer Programming, Volume 9 / Sorting and Searching, Addison-Wesley Publishing Company, Reading, Mass., 1973.
10. J. Lee, E. Shragowitz, and S. Sahni, A hypercube dgorithm for the 0/1 knapsack problem, Proceedings of the 1987 International Conference on Parallel Processing, pp. 699-706.
11. S.K. Park and K.W. Miller, Random number generators: good ones are hard to find, Communications of the ACM, Oct. 1988, pp. 1192-1201.
12. N. Toomarian, A concurrent neural network algorithms for the traveling salesman problem, Proceedings of the Third Conference on Hypercube Concurreni Computers and Applications, 1988, pp. 1485-1490.
13. N. Wirth, Algorithms + Data Structures = Programs, Prentice-Hall, Englewood Clins, New Jersey, 1976.