Home > Research > Publications & Outputs > New valid inequalities and facets for the simpl...

Research

Associated organisational units

Electronic data

  • splp-facets

    Rights statement: This is the author’s version of a work that was accepted for publication in European Journal of Operational Research. 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 European Journal of Operational Research, 269, 3, 2018 DOI: 10.1016/j.ejor.2018.03.009

    Accepted author manuscript, 335 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

New valid inequalities and facets for the simple plant location problem

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

Published

Standard

New valid inequalities and facets for the simple plant location problem. / Galli, Laura; Letchford, Adam Nicholas; Miller, Sebastian.
In: European Journal of Operational Research, Vol. 269, No. 3, 16.09.2018, p. 824-833.

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

Harvard

Galli, L, Letchford, AN & Miller, S 2018, 'New valid inequalities and facets for the simple plant location problem', European Journal of Operational Research, vol. 269, no. 3, pp. 824-833. https://doi.org/10.1016/j.ejor.2018.03.009

APA

Galli, L., Letchford, A. N., & Miller, S. (2018). New valid inequalities and facets for the simple plant location problem. European Journal of Operational Research, 269(3), 824-833. https://doi.org/10.1016/j.ejor.2018.03.009

Vancouver

Galli L, Letchford AN, Miller S. New valid inequalities and facets for the simple plant location problem. European Journal of Operational Research. 2018 Sept 16;269(3):824-833. Epub 2018 Mar 13. doi: 10.1016/j.ejor.2018.03.009

Author

Galli, Laura ; Letchford, Adam Nicholas ; Miller, Sebastian. / New valid inequalities and facets for the simple plant location problem. In: European Journal of Operational Research. 2018 ; Vol. 269, No. 3. pp. 824-833.

Bibtex

@article{63f073dff2e849cd959cf48d5752247d,
title = "New valid inequalities and facets for the simple plant location problem",
abstract = "The Simple Plant Location Problem is a well-known (and NP-hard) combinatorial optimisation problem, with applications in logistics. We present a new family of valid inequalities for the associated family of polyhedra, and show that it contains an exponentially large number of new facet-defining members. We also present a new procedure, called facility augmentation, which enables one to derive even more valid and facet-defining inequalities.",
keywords = "facility location, combinatorial optimisation, polyhedral combinatorics",
author = "Laura Galli and Letchford, {Adam Nicholas} and Sebastian Miller",
note = "This is the author{\textquoteright}s version of a work that was accepted for publication in European Journal of Operational Research. 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 European Journal of Operational Research, 269, 3, 2018 DOI: 10.1016/j.ejor.2018.03.009",
year = "2018",
month = sep,
day = "16",
doi = "10.1016/j.ejor.2018.03.009",
language = "English",
volume = "269",
pages = "824--833",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier Science B.V.",
number = "3",

}

RIS

TY - JOUR

T1 - New valid inequalities and facets for the simple plant location problem

AU - Galli, Laura

AU - Letchford, Adam Nicholas

AU - Miller, Sebastian

N1 - This is the author’s version of a work that was accepted for publication in European Journal of Operational Research. 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 European Journal of Operational Research, 269, 3, 2018 DOI: 10.1016/j.ejor.2018.03.009

PY - 2018/9/16

Y1 - 2018/9/16

N2 - The Simple Plant Location Problem is a well-known (and NP-hard) combinatorial optimisation problem, with applications in logistics. We present a new family of valid inequalities for the associated family of polyhedra, and show that it contains an exponentially large number of new facet-defining members. We also present a new procedure, called facility augmentation, which enables one to derive even more valid and facet-defining inequalities.

AB - The Simple Plant Location Problem is a well-known (and NP-hard) combinatorial optimisation problem, with applications in logistics. We present a new family of valid inequalities for the associated family of polyhedra, and show that it contains an exponentially large number of new facet-defining members. We also present a new procedure, called facility augmentation, which enables one to derive even more valid and facet-defining inequalities.

KW - facility location

KW - combinatorial optimisation

KW - polyhedral combinatorics

U2 - 10.1016/j.ejor.2018.03.009

DO - 10.1016/j.ejor.2018.03.009

M3 - Journal article

VL - 269

SP - 824

EP - 833

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -