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.
Galli, L., Letchford, A.N., Miller, S.J. (2018). New valid inequalities and facets for the Simple Plant Location Problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 269(3), 824-833 [10.1016/j.ejor.2018.03.009].
New valid inequalities and facets for the Simple Plant Location Problem
Laura Galli;
2018
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
