Copertina

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.

Salvato in:
Dettagli Bibliografici
Autori principali: Fernández, Elena (Autore) , Luna-Mota, Carlos (Autore) , Hildenbrandt, Achim (Autore) , Reinelt, Gerhard (Autore) , Wiesberg, Stefan (Autore)
Natura: Article (Journal)
Lingua:inglese
Pubblicazione: 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
Accesso online:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1016/j.endm.2013.05.079
Verlag, lizenzpflichtig, Volltext: https://www.sciencedirect.com/science/article/pii/S1571065313000802
Testo
Note sull'autore:Elena Fernández, Carlos Luna-Mota, Achim Hildenbrandt, Gerhard Reinelt, Stefan Wiesberg
Descrizione
Riassunto: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.
Descrizione del documento:Gesehen am 12.03.2021
Descrizione fisica:Online Resource
ISSN:1571-0653
DOI:10.1016/j.endm.2013.05.079

Documenti analoghi