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.
A separation algorithm for the simple plant location problem
Galli L.;
2021-01-01
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 in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
splp-sep.pdf
Open Access dal 02/08/2023
Descrizione: main article
Tipologia:
Documento in Post-print
Licenza:
Creative commons
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.
