Home > Research > Publications & Outputs > A polyhedral approach to the single row facilit...
View graph of relations

A polyhedral approach to the single row facility layout problem

Research output: Contribution to journalJournal article


<mark>Journal publication date</mark>10/2013
<mark>Journal</mark>Mathematical Programming
Issue number1-2
Number of pages25
Pages (from-to)453-477
Early online date21/03/12
<mark>Original language</mark>English


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.