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

C. Feremans; M. Labbé; G. Laporte

doi:10.1002/net.10009

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

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

^*Corresponding author for this work

Quantitative Economics

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

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 language	English
Pages (from-to)	29-34
Journal	Networks
Volume	39
Issue number	1
DOIs	https://doi.org/10.1002/net.10009
Publication status	Published - 1 Jan 2002

Access to Document

10.1002/net.10009

Cite this

@article{7371ebfe73f24a35bf4ea7ab588e7ed6,

title = "A Comparative Analysis of Several Forumulations for the Generalized Minimum Spanning Tree Problem",

abstract = "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. ",

author = "C. Feremans and M. Labb{\'e} and G. Laporte",

year = "2002",

month = jan,

day = "1",

doi = "10.1002/net.10009",

language = "English",

volume = "39",

pages = "29--34",

journal = "Networks",

issn = "0028-3045",

publisher = "Wiley-Liss Inc.",

number = "1",

}

TY - JOUR

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

AU - Feremans, C.

AU - Labbé, M.

AU - Laporte, G.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

U2 - 10.1002/net.10009

DO - 10.1002/net.10009

M3 - Article

SN - 0028-3045

VL - 39

SP - 29

EP - 34

JO - Networks

JF - Networks

IS - 1

ER -