A Comparative Analysis of Several Forumulations for the Generalized Minimum Spanning Tree Problem

C. Feremans, M. Labbé, G. Laporte*

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


This article describes eight formulations for the generalized minimum spanning tree problem (gmstp). Relationships between the polytopes of their linear relaxations are established. It is shown that four of these polytopes are strictly included in the remaining ones. This analysis suggests which formulations should be preferred for the construction of a branch-and-cut algorithm and for the evaluation of heuristics.
Original languageEnglish
Pages (from-to)29-34
Issue number1
Publication statusPublished - 1 Jan 2002

Cite this