Integer Linear Programming models are presented for two generalizations of the well know Minimum Spanning Tree Problem: the "Cost Constrained Minimum Label Spanning Tree Problem" and the "Label Constrained Minimum Spanning Tree Problem". The two considered problems are NP-Hard. Metaheuristic algorithms are proposed for their solution. Computational results on benchmark instances from the literature show the effectiveness of the proposed approaches.
The Cost Constrained Minimum Label Spanning Tree and Label Constrained Minimum Spanning Tree Problems
TOTH, PAOLO
2009
Abstract
Integer Linear Programming models are presented for two generalizations of the well know Minimum Spanning Tree Problem: the "Cost Constrained Minimum Label Spanning Tree Problem" and the "Label Constrained Minimum Spanning Tree Problem". The two considered problems are NP-Hard. Metaheuristic algorithms are proposed for their solution. Computational results on benchmark instances from the literature show the effectiveness of the proposed approaches.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
