String processing algorithms for plant layout problems
作者:
JOUKOJ. SEPPANEN,
JAMESM. MOORE,
期刊:
International Journal of Production Research
(Taylor Available online 1975)
卷期:
Volume 13,
issue 3
页码: 239-254
ISSN:0020-7543
年代: 1975
DOI:10.1080/00207547508942994
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
Difficulties in recognition of planarity of graphs in the context of layout problems are reviewed. A problem oriented linear string representation for trees and the concept of grammar are then introduced as basic tools for symbolic computation of trees and planar graphs. A heuristic method to solve the layout problem is next discussed and the need of optimal algorithmic techniques is pointed out. Finally the application of list processing techniques for manipulation by computer is suggested.
点击下载:
PDF (491KB)
返 回