On the weight-constrained minimum spanning tree problem

Authors:
Agostinho Agra;Adelaide Cerveira;Cristina Requejo;Eulália Santos
Affiliations:
CIDMA and Department of Mathematics, University of Aveiro, Aveiro, Portugal;CIO and Department of Mathematics, University of Trás-os-Montes and Alto Douro, Vila Real, Portugal;CIDMA and Department of Mathematics, University of Aveiro, Aveiro, Portugal;CIDMA and School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 6
Cited 0

Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints

Computers and Operations Research
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
The Constrained Minimum Spanning Tree Problem (Extended Abstract)

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection

SIAM Journal on Computing
Separation algorithms for 0-1 knapsack polytopes

Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.