A polyhedral approach to the single row facility layout problem

Letchford, A N and Amaral, Andre (2011) A polyhedral approach to the single row facility layout problem. Working Paper. The Department of Management Science, Lancaster University.

Full text not available from this repository.


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.

Item Type:
Monograph (Working Paper)
Additional Information:
This was eventually published as: A.R.S. Amaral & A.N. Letchford (2013) A polyhedral approach to the single-row facility layout problem. Math. Program., 141(1-2), 453-477.
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
11 Jul 2011 21:30
Last Modified:
22 Nov 2022 15:15