Galli, Laura and Letchford, Adam Nicholas and Miller, Sebastian (2018) New valid inequalities and facets for the simple plant location problem. European Journal of Operational Research, 269 (3). pp. 824-833. ISSN 0377-2217
Preview
PDF (splp-facets)
splp_facets.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (343kB)
splp_facets.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (343kB)
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.
Item Type:
Journal Article
Journal or Publication Title:
European Journal of Operational Research
Additional Information:
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
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2611
Subjects:
?? facility locationcombinatorial optimisationpolyhedral combinatoricsmodelling and simulationmanagement science and operations researchinformation systems and managementdiscipline-based research ??
Departments:
ID Code:
123879
Deposited By:
Deposited On:
07 Mar 2018 09:02
Refereed?:
Yes
Published?:
Published
Last Modified:
27 Oct 2024 00:18