Graph theoretic heuristics for the plant layout problem

International Journal of Production Research

Volumn 16, Issue 1, 1978, Pages 27-37

  Foulds, L R ^a   Robinson, D F ^b  

^a MASSEY UNIVERSITY   (New Zealand)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

HEURISTICS;

INDUSTRIAL PLANTS;

EID: 0017926572     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207547808929997     Document Type: Article

References (5)

1. Dunn, W. R., and Chan, S. P., 1958, An algorithm for testing the planarity of a graph, I.E.E.E. Trans, circuit Theory, 5, 166.
2. Fisher, G. J., and Wing, D., 1960, Computer recognition and extraction of planar graphs from the incidence matrix, I.E.E.E. Trans, circuit Theory, 13, 154.
3. Foulds, L. R., and Robinson, D. F., 1976, A strategy for solving the plant layout problem, Opl Res. Q., 27, 845.
4. Harauy, F., 1969, Graph Theory (Reading, Massachusetts: Addison Wesley).
5. Hopcroft, J., and Tarjan, R., 1974, Efficient planarity testing,.J,.Ass. comput. Mach., 21, 549.