1 |
Heragu, S. S. and A. Kusiak, "Efficient models for the facility layout problem," Eur. J. Oper. Res. 53 (1991), 1-13.
DOI
ScienceOn
|
2 |
Picard, J. and M. Queyranne, "On the one-dimensional space allocation problem," Operations Research 29 (1981), 371-391.
DOI
ScienceOn
|
3 |
Simmons, D. M., "One-dimensional space allocation: An ordering algorithm," Operations Research 17 (1969), 812-826.
DOI
ScienceOn
|
4 |
Anjos, M. F., "A. Kennings, and A. Vannelli, A semidefinite optimization approach for the single-row facility layout problem with unequal dimensions," Discrete Optim. 2 (2005), 113-122.
DOI
ScienceOn
|
5 |
Barnhart, C., C. A. Hane, and P. H. Vance, "Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems," Operations Research 48 (2000), 318-326.
DOI
ScienceOn
|
6 |
Nemhauser, G. L. and L. A. Wolsey, "Integer and Combinatorial Optimization," John Wiely and Sons, Inc. 1988.
|
7 |
Grotschel, M., M. Jiinger, and G. Reinelt, "A cutting plane algorithm for the linear ordering problem," Operations Research 32 (1984), 1195-1120.
DOI
ScienceOn
|
8 |
Grotschel, M., M. Jiinger, and G. Reinelt, "Facets of the linear ordering polytope," Math. Programming 33 (1984), 43-60.
|
9 |
Heragu, S. S. and A. Kusiak, "Machine layout problem in flexible manufacturing systems," Operations Research 36 (1988), 258-268.
DOI
ScienceOn
|
10 |
Amaral, A. R. S., "An exact approach to the one-dimensional facility layout problem," Operations Research 56 (2008), 1026-1033.
DOI
ScienceOn
|