Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6894663 | European Journal of Operational Research | 2018 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Laura Galli, Adam N. Letchford, Sebastian J. Miller,