A parallel stochastic optimization algorithm for finding mappings of the rectilinear minimal crossing problem

Ars Combinatoria

Volumn 43, Issue , 1996, Pages 135-148

  Thorpe, John T ^a,b   Harris, Frederick C ^a  

^a South   (United States)

^b CDT   (United States)

Author keywords

Parallel Genetic Algorithms; Rectilinear Minimal Crossing

Indexed keywords

EID: 0030478525     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. J. Blažek and M. Koman. A minimal problem concerning complete plane graphs. In M. Fiedler, editor, Theory of Graphs and its Applications, pages 113-117. Academic Press, New York, 1964.
2. K.C. Chang. Efficient algorithms for layer assignment problems. IEEE Trans, on Computer Aided Design of Integrated Circuits and Systems, 6(1):67-71, January 1987.
3. G. Chartrand and L. Lesniak. Graphs and Digraphs. Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, CA, 2nd. edition, 1986.
4. L. Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.
5. G. Exoo. Private Communication, results to be submitted for publication soon.
6. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1982.
7. D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.
8. R.K. Guy. A minimal problem concerning complete plane graphs. In Y. Alavi, D.R. Lick, and A.T. White, editors, Graph Theory and Applications, pages 111-124, Berlin, 1972. Springer-Verlag.
9. R.K. Guy, November 24, 1992. Private Communication with R.P. Pargas.
10. J. Hines, J.T. Thorpe, and K.B. Winiecki. Solving quadratic assignment problems through parallel genetic algorithms. Unpublished Tech Report, Clemson University, May 1992.
11. D.S. Johnson. The NP-Completeness column: an ongoing guide. Journal of Algorithms, 3(1):89-99, March 1982.
12. Y. Wang, R.C.T. Lee, and J.S. Chang. The number of intersections between two rectangular paths. IEEE Trans, on Computers, 38(11):1564-1571, November 1989.