Home > Research > Publications & Outputs > New valid inequalities and facets for the simpl...
View graph of relations

New valid inequalities and facets for the simple plant location problem

Research output: Contribution to journalJournal article

<mark>Journal publication date</mark>6/03/2018
<mark>Journal</mark>European Journal of Operational Research
<mark>State</mark>Accepted/In press
<mark>Original language</mark>English


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.