Home > Research > Publications & Outputs > A separation algorithm for the simple plant loc...

Research

Associated organisational units

Electronic data

  • splp-sep

    Rights statement: 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, 49, 4, 2021 DOI: 10.1016/j.orl.2021.06.011

    Accepted author manuscript, 303 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

Keywords

View graph of relations

A separation algorithm for the simple plant location problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A separation algorithm for the simple plant location problem. / Galli, Laura; Letchford, Adam.
In: Operations Research Letters, Vol. 49, No. 4, 31.07.2021, p. 610-615.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Galli, L & Letchford, A 2021, 'A separation algorithm for the simple plant location problem', Operations Research Letters, vol. 49, no. 4, pp. 610-615. https://doi.org/10.1016/j.orl.2021.06.011

APA

Galli, L., & Letchford, A. (2021). A separation algorithm for the simple plant location problem. Operations Research Letters, 49(4), 610-615. https://doi.org/10.1016/j.orl.2021.06.011

Vancouver

Galli L, Letchford A. A separation algorithm for the simple plant location problem. Operations Research Letters. 2021 Jul 31;49(4):610-615. Epub 2021 Jun 23. doi: 10.1016/j.orl.2021.06.011

Author

Galli, Laura ; Letchford, Adam. / A separation algorithm for the simple plant location problem. In: Operations Research Letters. 2021 ; Vol. 49, No. 4. pp. 610-615.

Bibtex

@article{7c8e680310864b4cb0fe166be1f0295e,
title = "A separation algorithm for the simple plant location problem",
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 computationalresults.",
keywords = "facility location, combinatorial optimisation",
author = "Laura Galli and Adam Letchford",
note = "This is the author{\textquoteright}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",
year = "2021",
month = jul,
day = "31",
doi = "10.1016/j.orl.2021.06.011",
language = "English",
volume = "49",
pages = "610--615",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "4",

}

RIS

TY - JOUR

T1 - A separation algorithm for the simple plant location problem

AU - Galli, Laura

AU - Letchford, Adam

N1 - 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

PY - 2021/7/31

Y1 - 2021/7/31

N2 - 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 computationalresults.

AB - 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 computationalresults.

KW - facility location

KW - combinatorial optimisation

U2 - 10.1016/j.orl.2021.06.011

DO - 10.1016/j.orl.2021.06.011

M3 - Journal article

VL - 49

SP - 610

EP - 615

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 4

ER -