Lancaster EPrints

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: Article
Journal or Publication Title: Mathematical Programming
Uncontrolled Keywords: facility layout ; polyhedral combinatorics ; branch-and-cut
Subjects: H Social Sciences > HB Economic Theory
Departments: Lancaster University Management School > Management Science
ID Code: 52995
Deposited By: ep_importer_pure
Deposited On: 15 Mar 2012 10:17
Refereed?: Yes
Published?: Published
Last Modified: 27 Sep 2013 10:25
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/52995

Actions (login required)

View Item