Modeling and solving the bi-objective minimum diameter-cost spanning tree problem

The bi-objective minimum diameter-cost spanning tree problem (bi-MDCST) seeks spanning trees with minimum total cost and minimum diameter. The bi-objective version generalizes the well-known bounded diameter minimum spanning tree problem. The bi-MDCST is a NP-hard problem and models several practica...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of global optimization 2014-10, Vol.60 (2), p.195-216
Hauptverfasser:	Santos, Andréa Cynthia, Lima, Diego Rocha, Aloise, Dario José
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Real Functions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!