2013
DOI: 10.1080/0740817x.2012.693649
|View full text |Cite
|
Sign up to set email alerts
|

On the block layout shortest loop design problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…To demonstrate its performance, several problems were tested. Subsequently, Ahmadi-Javid and Ramshe [24] corrected the ILP formulation and developed a cutting-plane algorithm to generate reasonable computational results. Over time, other researchers have tried to develop a variety of powerful meta-heuristics to obtain better layout solutions in less computational time.…”
Section: Background and Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…To demonstrate its performance, several problems were tested. Subsequently, Ahmadi-Javid and Ramshe [24] corrected the ILP formulation and developed a cutting-plane algorithm to generate reasonable computational results. Over time, other researchers have tried to develop a variety of powerful meta-heuristics to obtain better layout solutions in less computational time.…”
Section: Background and Literature Reviewmentioning
confidence: 99%
“…As mentioned, the models to find the shortest loop in a given layout were proposed by several studies [23,24,40,41]. In this study, searching for the shortest loop in the layout should proceed in every iteration of the layout design process.…”
Section: Parameters and Variables Nmentioning
confidence: 99%