In this paper we present a cutting plane algorithm for the Set Covering problem. Cutting planes are generated by running an "exact" separation algorithm over the subproblems defined by suitably small subsets of the formulation constraints. Computational results on difficult small-medium size instances are reported.
Computational experience with general cutting planes for the Set Covering problem
AVELLA P;
2009-01-01
Abstract
In this paper we present a cutting plane algorithm for the Set Covering problem. Cutting planes are generated by running an "exact" separation algorithm over the subproblems defined by suitably small subsets of the formulation constraints. Computational results on difficult small-medium size instances are reported.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
ORL_2009.pdf
non disponibili
Licenza:
Non specificato
Dimensione
432.56 kB
Formato
Adobe PDF
|
432.56 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
