A Feasibility Pump and a Local Branching Heuristics for the Weight-Constrained Minimum Spanning Tree Problem
The Weight-constrained Minimum Spanning Tree problem (WMST) is a combinatorial optimization problem aiming to find a spanning tree of minimum cost with total edge weight not exceeding a given specified limit. This problem has important applications in the telecommunications network design and communication networks.
In order to obtain optimal or near optimal solutions to the WMST problem we use heuristic methods based on formulations for finding feasible solutions. The feasibility pump heuristic starts with the LP solution, iteratively fixes the values of some variables and solves the corresponding LP problem until a feasible solution is achieved. In the local branching heuristic a feasible solution is improved by using a local search scheme in which the solution space is reduced to the neighborhood of a feasible solution that is explored for a better feasible solution. Extensive computational results show that these heuristics are quite effective in finding feasible solutions and present small gap values. Each heuristic can be used independently, however the best results were obtained when they are used together and the feasible solution obtained by the feasibility pump heuristic is improved by the local branching heuristic.
KeywordsWeighted MST Minimum spanning tree Feasibility Pump Local Branching Heuristics
The research of the authors has been partially supported by Portuguese funds through the CIDMA (Center for Research and Development in Mathematics and Applications) and the FCT, the Portuguese Foundation for Science and Technology, within project UID/MAT/04106/2013.
- 10.Henn, S.: Weight-constrained minimum spanning tree problem. Master’s thesis, University of Kaiserslautern, Kaiserslautern, Germany (2007)Google Scholar
- 12.Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M., Magnanti, T.L., Monma, C., Nemhauser, G.L. (eds.) Network Models, Handbooks in Operations Research and Management Science, vol. 7, pp. 503–615. Elsevier Science Publishers, North-Holland (1995)Google Scholar
- 17.Requejo, C., Santos, E.: Lagrangian based algorithms for the weight-constrained minimum spanning tree problem. In: Proceedings of the VII ALIO/EURO Workshop on Applied Combinatorial Optimization, pp. 38–41 (2011)Google Scholar
- 20.Xue, G.: Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees. In: Proceedings of the IEEE International Conference on Performance, Computing, and Communications, pp. 271–277 (2000)Google Scholar