Home > Research > Publications & Outputs > A polyhedral approach to the single row facilit...

Research

Associated organisational unit

Links

Text available via DOI:

Keywords

View graph of relations

A polyhedral approach to the single row facility layout problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A polyhedral approach to the single row facility layout problem. / Amaral, André R. S.; Letchford, Adam.
In: Mathematical Programming, Vol. 141, No. 1-2, 10.2013, p. 453-477.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Amaral, ARS & Letchford, A 2013, 'A polyhedral approach to the single row facility layout problem', Mathematical Programming, vol. 141, no. 1-2, pp. 453-477. https://doi.org/10.1007/s10107-012-0533-z

APA

Amaral, A. R. S., & Letchford, A. (2013). A polyhedral approach to the single row facility layout problem. Mathematical Programming, 141(1-2), 453-477. https://doi.org/10.1007/s10107-012-0533-z

Vancouver

Amaral ARS, Letchford A. A polyhedral approach to the single row facility layout problem. Mathematical Programming. 2013 Oct;141(1-2):453-477. Epub 2012 Mar 21. doi: 10.1007/s10107-012-0533-z

Author

Amaral, André R. S. ; Letchford, Adam. / A polyhedral approach to the single row facility layout problem. In: Mathematical Programming. 2013 ; Vol. 141, No. 1-2. pp. 453-477.

Bibtex

@article{c07f456086c741c7a4a7ec9850dbb170,
title = "A polyhedral approach to the single row facility layout problem",
abstract = "The Single Row Facility Layout Problem (SRFLP) is the NP-hard problem of arranging facilities on a line, while minimizing a weighted sum of the distances between facility pairs. In this paper, a detailed polyhedral study of the SRFLP is performed, and several huge classes of valid and facet-inducing inequalities are derived. Some separation heuristics are presented, along with a primal heuristic based on multidimensional scaling. Finally, a branch-and-cut algorithm is described and some encouraging computational results are given.",
keywords = "facility layout, polyhedral combinatorics, branch-and-cut",
author = "Amaral, {Andr{\'e} R. S.} and Adam Letchford",
year = "2013",
month = oct,
doi = "10.1007/s10107-012-0533-z",
language = "English",
volume = "141",
pages = "453--477",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "1-2",

}

RIS

TY - JOUR

T1 - A polyhedral approach to the single row facility layout problem

AU - Amaral, André R. S.

AU - Letchford, Adam

PY - 2013/10

Y1 - 2013/10

N2 - The Single Row Facility Layout Problem (SRFLP) is the NP-hard problem of arranging facilities on a line, while minimizing a weighted sum of the distances between facility pairs. In this paper, a detailed polyhedral study of the SRFLP is performed, and several huge classes of valid and facet-inducing inequalities are derived. Some separation heuristics are presented, along with a primal heuristic based on multidimensional scaling. Finally, a branch-and-cut algorithm is described and some encouraging computational results are given.

AB - The Single Row Facility Layout Problem (SRFLP) is the NP-hard problem of arranging facilities on a line, while minimizing a weighted sum of the distances between facility pairs. In this paper, a detailed polyhedral study of the SRFLP is performed, and several huge classes of valid and facet-inducing inequalities are derived. Some separation heuristics are presented, along with a primal heuristic based on multidimensional scaling. Finally, a branch-and-cut algorithm is described and some encouraging computational results are given.

KW - facility layout

KW - polyhedral combinatorics

KW - branch-and-cut

U2 - 10.1007/s10107-012-0533-z

DO - 10.1007/s10107-012-0533-z

M3 - Journal article

VL - 141

SP - 453

EP - 477

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 1-2

ER -