|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
B.S. Baker, E.G. Coffman, R.L. Rivest, "Orthogonal Packings in Two Dimensions," SIAM Journal of Computing, 9 (4), pp. 846-855, November 1980.
|
| |
2
|
|
| |
3
|
H. Carl~nter and W.B. Dowsland, "Practical Considerations of the Pallet-Loading Problem," Journal of the Operational Research Society, 36 (6), pp. 489-497, 1985.
|
| |
4
|
N. Christofides, A. Mingozzi, and P. Toth, "The Vehicle Routing Problem" in Combinatorial Optimization, John Wiley, New York, 1989, pp. 315-338.
|
| |
5
|
E.G. Coffman, M.R. Garey, D.S. Johnson, and R.E. Terjan, "Performance Bounds for Level-Oriente~ Two- Dimensional Packing Algorithms," SIAM Journal of Computing, 9 (4), pp. 808-826, November 1980.
|
| |
6
|
L. Davis, ed., Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991.
|
| |
7
|
|
| |
8
|
|
| |
9
|
K.A. Dowsland, "An Exact Algorithm for the Pallet Loading Problem," European Journal of Operational Research, 31, pp. 78-84, 1987.
|
| |
10
|
R. Fenrich, R. Miller, and Q.F. Stout, "Hypercube Algorithms for some NP-Hard Packing Problems." Proceedings of the Fourth Conference on Hypercube Concurrent Computers and Applications, pp. 769-76. 1989.
|
| |
11
|
R. Fenrich, R. Miller, and Q.F. Stout, "Multi-Tiered Algorithms for 2-Dimensional Bin Packing," Proceedings of the F~h Conference on Hypercube Concurrent Computers and Applications, pp. 58-63, 1990.
|
| |
12
|
S. Floyd and R.M. Karp, "FFD Bin Packing for Item Sizes with Uniform Distributions on {0, 1/2}", Algorithmica, 6 (2), pp. 222-239, 1991.
|
| |
13
|
M.R. Garey and D.S. Johnson, "Approximation Algorithms for Bin Packing Problems: A Survey," in Ausiel- 1o, G. and M. Lucertini (ads.). Analysis and Design of Algorithms in Combinatorial Optimization. Springer- Verlag: New York. 1981.
|
| |
14
|
|
| |
15
|
|
| |
16
|
D.S. Johnson, A. Darners, J.D. Ullman, M.R. Garey, and R.L. Graham, "Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms," SIAM Journal of Computing, 3 (4), pp. 299-325, December 1974.
|
| |
17
|
L. Knight and R. Wainwright, "HYPERGEN: A Distribut~ Genetic Algorithm on a H~cube", submitted for review.
|
| |
18
|
E.L. Lawler, J.K Lenstra, A.H.G.R. Kan, D.B. Shmoys (eds.). The Traveling Salesman Problem. John Wiley & Sons: New York (1985).
|
| |
19
|
|
| |
20
|
G.E. Liepins and M.D. Vose, "Deceptveness and Genic Algorithm Dynamics, Fou~u/at~ of Genetic Algorithms, G. Rawling, ecl., Morgan Kaufmann Publishers, 1991.
|
| |
21
|
G.E. Liepins and M.D. Vose, "Characterizing Crossover in Genetic Algorithms", submitted to Annals of Mathe. matics and An~wial intelligence
|
| |
22
|
I. Lin, C. Chang, B. Foote, and I.Y. Cheung, "A SMILE for Packing & Pallet Loading in Three Dimensions," to appear.
|
| |
23
|
|
| |
24
|
|
| |
25
|
|
| |
26
|
|
| |
27
|
D. Whitney and }'. Kauth, GENITOR: A Different Genetic Algorithm, Proceedings of the Rocky Mountain Conference on Artificial Intelligence, Denver, Co., 1988, pp. 118-130.
|
| |
28
|
|
CITED BY 9
|
|
|
|
|
Faris N. Abuali , Roger L. Wainwright , Dale A. Schoenefeld, Solving the three-star tree isomorphism problem using genetic algorithms, Proceedings of the 1995 ACM symposium on Applied computing, p.337-344, February 26-28, 1995, Nashville, Tennessee, United States
|
|
|
|
|
|
Faris N. Abuali , Roger L. Wainwright , Dale A. Schoenefeld, Determinant factorization and cycle basis: encoding schemes for the representation of spanning trees on incomplete graphs, Proceedings of the 1995 ACM symposium on Applied computing, p.305-312, February 26-28, 1995, Nashville, Tennessee, United States
|
|
|
|
|
|
Kelly D. Crawford , Daniel J. Vasicek , Roger L. Wainwright, Detecting multiple outliers in regression data using genetic algorithms, Proceedings of the 1995 ACM symposium on Applied computing, p.351-356, February 26-28, 1995, Nashville, Tennessee, United States
|
|
|
Faris N. Abuali , Dale A. Schoenefeld , Roger L. Wainwright, Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees, Proceedings of the 1994 ACM symposium on Applied computing, p.242-246, March 06-08, 1994, Phoenix, Arizona, United States
|
|
|
|
|
|
|
|