On the Weight-Constrained Minimum Spanning Tree Problem
We consider the weight-constrained minimum spanning tree problem which has important applications in telecommunication networks design. We discuss and compare several formulations. In order to strengthen these formulations, new classes of valid inequalities are introduced. They adapt the well-known cover, extended cover and lifted cover inequalities. They incorporate information from the two subsets: the set of spanning trees and the knapsack set. We report computational experiments where the best performance of a standard optimization package was obtained when using a formulation based on the well-known Miller-Tucker-Zemlin variables combined with separation of cut-set inequalities.
KeywordsValid Inequality Linear Relaxation Span Tree Problem Weight Constraint Minimum Span Tree Problem
Unable to display preview. Download preview PDF.
- 8.Pisinger, D.: Where are the hard knapsack problems? Technical Report 2003/08, DIKU, University of Copenhagen, Denmark (2003)Google Scholar