Cover Image

A flow formulation for the optimum communication spanning Ttee

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.

Saved in:
Bibliographic Details
Main Authors: Fernández, Elena (Author) , Luna-Mota, Carlos (Author) , Hildenbrandt, Achim (Author) , Reinelt, Gerhard (Author) , Wiesberg, Stefan (Author)
Format: Article (Journal)
Language:English
Published: June 5, 2013
In: Electronic notes in discrete mathematics
Year: 2013, Volume: 41, Pages: 85-92
ISSN:1571-0653
DOI:10.1016/j.endm.2013.05.079
Online Access:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1016/j.endm.2013.05.079
Verlag, lizenzpflichtig, Volltext: https://www.sciencedirect.com/science/article/pii/S1571065313000802
Get full text
Author Notes:Elena Fernández, Carlos Luna-Mota, Achim Hildenbrandt, Gerhard Reinelt, Stefan Wiesberg
Description
Summary: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.
Item Description:Gesehen am 12.03.2021
Physical Description:Online Resource
ISSN:1571-0653
DOI:10.1016/j.endm.2013.05.079

Similar Items