Loading...
Loading...

Go to the content (press return)

A flow formulation for the optimum communication spanning tree

Author
Fernandez, E.; Luna , C.; Hildenbrandt, A.; Reinelt, G.; Wiesberg, S.
Type of activity
Presentation of work at congresses
Name of edition
International Network Optimization Conference 2013
Date of publication
2013
Presentation's date
2013-05-20
Book of congress proceedings
INOC 2013: International Network Optimization Conference, May 20-22, 2013
First page
1
Last page
8
Publisher
Universidad de La Laguna
Repository
http://hdl.handle.net/2117/22154 Open in new window
URL
https://ddv.ull.es/users/inoc2013/public/Proceedings/ENDM-016.pdf Open in new window
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.
Citation
Fernandez, E. [et al.]. A flow formulation for the optimum communication spanning tree. A: International Network Optimization Conference. "INOC 2013: International Network Optimization Conference, May 20-22, 2013". Tenerife: Universidad de La Laguna, 2013, p. 1-8.
Keywords
Optimum Communication Spanning Tree, Spanning tree
Group of research
PROMALS - Research Group in Mathematical Programming, Logistics and Simulation

Participants

  • Fernandez Areizaga, Elena  (author and speaker )
  • Luna Mota, Carlos  (author and speaker )
  • Hildenbrandt, Achim  (author and speaker )
  • Reinelt, Gerard  (author and speaker )
  • Wiesberg, Stefan  (author and speaker )

Attachments