A separation algorithm for the simple plant location problem

Galli, Laura and Letchford, Adam (2021) A separation algorithm for the simple plant location problem. Operations Research Letters, 49 (4). pp. 610-615. ISSN 0167-6377

[img]
Text (splp-sep)
splp_sep.pdf - Accepted Version
Restricted to Repository staff only until 23 December 2022.
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.

Download (310kB)

Abstract

The Simple Plant Location Problem (SPLP) is a well-known NP-hard optimisation problem with applications in logistics. Although many families of facet-defining inequalities are known for the associated polyhedron, very little work has been done on separation algorithms. We present the first ever polynomial-time separation algorithm for the SPLP that separates exactly over an exponentially large family of facet-defining inequalities. We also present some promising computational results.

Item Type:
Journal Article
Journal or Publication Title:
Operations Research Letters
Additional Information:
This is the author’s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, vol. 49, issue 4, pp. 610-615, 2021. DOI: 10.1016/j.orl.2021.06.011
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2200/2209
Subjects:
ID Code:
156127
Deposited By:
Deposited On:
14 Jun 2021 16:00
Refereed?:
Yes
Published?:
Published
Last Modified:
31 Jul 2021 07:05