Facilities layout generalized model solved by n-boundary shortest path heuristics
- 31 March 1987
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 28 (3), 382-391
- https://doi.org/10.1016/s0377-2217(87)80181-9
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic HeuristicsOperations Research, 1985
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be AdjacentManagement Science, 1983
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian CircuitOperations Research, 1979
- Approximative Algorithms for Discrete Optimization ProblemsAnnals of Discrete Mathematics, 1979
- Graph theory and computer aided facilities designOmega, 1978
- Efficient Planarity TestingJournal of the ACM, 1974
- Computer-aided plant layoutComputer-Aided Design, 1969
- Computer Recognition and Extraction of Planar Graphs from the Incidence MatrixIEEE Transactions on Circuit Theory, 1966
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A Note on the Generation of Random Normal DeviatesThe Annals of Mathematical Statistics, 1958