A polyhedral approach to the single row facility layout problem

Amaral, André R. S. and Letchford, Adam (2013) A polyhedral approach to the single row facility layout problem. Mathematical Programming, 141 (1-2). pp. 453-477. ISSN 0025-5610

Full text not available from this repository.

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.

Item Type:
Journal Article
Journal or Publication Title:
Mathematical Programming
Uncontrolled Keywords:
/dk/atira/pure/researchoutput/libraryofcongress/hb
Subjects:
ID Code:
52995
Deposited By:
Deposited On:
15 Mar 2012 10:17
Refereed?:
Yes
Published?:
Published
Last Modified:
20 Oct 2020 01:55