Journal article
M.F. Anjos, A. Vannelli
INFORMS Journal on Computing, vol. 20(4), 2008, pp. 611-617
INFORMS Journal on Computing, vol. 20(4), 2008, pp. 611-617
Semantic Scholar
DBLP
DOI
Cite
Cite
APA
Click to copy
Anjos, M. F., & Vannelli, A. (2008). Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS Journal on Computing, 20(4), 611–617. https://doi.org/10.1287/ijoc.1080.0270
Chicago/Turabian
Click to copy
Anjos, M.F., and A. Vannelli. “Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes.” INFORMS Journal on Computing 20, no. 4 (2008): 611–617.
MLA
Click to copy
Anjos, M. F., and A. Vannelli. “Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes.” INFORMS Journal on Computing, vol. 20, no. 4, 2008, pp. 611–17, doi:10.1287/ijoc.1080.0270.
BibTeX Click to copy
@article{m2008a,
title = {Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes},
year = {2008},
issue = {4},
journal = {INFORMS Journal on Computing},
pages = {611-617},
volume = {20},
doi = {10.1287/ijoc.1080.0270},
author = {Anjos, M.F. and Vannelli, A.}
}
Abstract
This paper is concerned with the single-row facility layout problem (SRFLP). A globally optimal solution to the SRFLP is a linear placement of rectangular facilities with varying lengths that achieves the minimum total cost associated with the (known or projected) interactions between them. We demonstrate that the combination of a semidefinite programming relaxation with cutting planes is able to compute globally optimal layouts for large SRFLPs with up to 30 facilities. In particular, we report the globally optimal solutions for two sets of SRFLPs previously studied in the literature, some of which have remained unsolved since 1988.
