The Simple Plant Location Problem (SPLP) is a well-known NP-hard optimisation problem with applications in logistics. Although many families of facet-defining inequalities are known for the associated polyhedron, very little work has been done on separation algorithms. We present the first ever polynomial-time separation algorithm for the SPLP that separates exactly over an exponentially large family of facet-defining inequalities. We also present some promising computational results.
Galli L., Letchford A.N. (2021). A separation algorithm for the simple plant location problem. OPERATIONS RESEARCH LETTERS, 49(4), 610-615 [10.1016/j.orl.2021.06.011].
A separation algorithm for the simple plant location problem
Galli L.;
2021
Abstract
The Simple Plant Location Problem (SPLP) is a well-known NP-hard optimisation problem with applications in logistics. Although many families of facet-defining inequalities are known for the associated polyhedron, very little work has been done on separation algorithms. We present the first ever polynomial-time separation algorithm for the SPLP that separates exactly over an exponentially large family of facet-defining inequalities. We also present some promising computational results.| File | Dimensione | Formato | |
|---|---|---|---|
|
splp-sep.pdf
accesso aperto
Tipo:
Postprint
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione - Non commerciale - Non opere derivate (CCBYNCND)
Dimensione
322.04 kB
Formato
Adobe PDF
|
322.04 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
