Title of article
A Flow Formulation for the Optimum Communication Spanning Tree
Author/Authors
Fernلndez، نويسنده , , Elena and Luna-Mota، نويسنده , , Carlos and Hildenbrandt، نويسنده , , Achim and Reinelt، نويسنده , , Gerhard and Wiesberg، نويسنده , , Stefan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
8
From page
85
To page
92
Abstract
In this paper we address the Optimum Communication Spanning Tree Problem. We present a formulation that uses three index variables and we propose several families of inequalities, which can be used to reinforce the formulation. Preliminary computational experiments are very promising.
Keywords
Optimum Communication Spanning Tree , spanning tree
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2013
Journal title
Electronic Notes in Discrete Mathematics
Record number
1456174
Link To Document