2010
DOI: 10.1007/s00170-010-2960-4
|View full text |Cite
|
Sign up to set email alerts
|

Constructing a block layout by face area

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…As a novel study, Osman (2006) [79] proposed a tabu search algorithm to create WMPG. Jokar and Sangchooli (2011) [80] attempted to create block plan layout from a maximal planar graph introducing a new algorithm, called BLAD (Block Layout Algorithm for Deltahedron heuristic). Zheng (2014) [81] presented a method to generate connectivity graph to contribute the facility layout generation from abstract stage.…”
Section: Fig 211 Layout Development By Graph Theorymentioning
confidence: 99%
“…As a novel study, Osman (2006) [79] proposed a tabu search algorithm to create WMPG. Jokar and Sangchooli (2011) [80] attempted to create block plan layout from a maximal planar graph introducing a new algorithm, called BLAD (Block Layout Algorithm for Deltahedron heuristic). Zheng (2014) [81] presented a method to generate connectivity graph to contribute the facility layout generation from abstract stage.…”
Section: Fig 211 Layout Development By Graph Theorymentioning
confidence: 99%