The Generalized Minimum Spanning Tree Problem: Polyhedral Analysis and Branch-and-Cut Algorithm

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

Research output: Working paper / Preprint › Working paper

Original language	English
Place of Publication	Maastricht
Publisher	Maastricht University School of Business and Economics
Publication status	Published - 1 Jan 2003

Cite this

@techreport{518ef06f712945b0bbfacc70a6bd7dac,

title = "The Generalized Minimum Spanning Tree Problem: Polyhedral Analysis and Branch-and-Cut Algorithm",

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

year = "2003",

month = jan,

day = "1",

language = "English",

publisher = "Maastricht University School of Business and Economics",

type = "WorkingPaper",

institution = "Maastricht University School of Business and Economics",

}

TY - UNPB

T1 - The Generalized Minimum Spanning Tree Problem: Polyhedral Analysis and Branch-and-Cut Algorithm

AU - Feremans, C.

AU - Labbé, M.

AU - Laporte, G.

PY - 2003/1/1

Y1 - 2003/1/1

M3 - Working paper

BT - The Generalized Minimum Spanning Tree Problem: Polyhedral Analysis and Branch-and-Cut Algorithm

PB - Maastricht University School of Business and Economics

CY - Maastricht

ER -