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.
New valid inequalities and facets for the Simple Plant Location Problem
Galli Laura;
2018-01-01
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
splp-facets.pdf
accesso aperto
Descrizione: articolo principale
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
318.32 kB
Formato
Adobe PDF
|
318.32 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
