Solving diameter-constrained minimum spanning tree problems by constraint programming

The diameter‐constrained minimum spanning tree problem consists in finding a minimum spanning tree of a given graph, subject to the constraint that the maximum number of edges between any two vertices in the tree is bounded from above by a given constant. This problem typically models network design...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International transactions in operational research Jg. 17; H. 5; S. 653 - 665
Hauptverfasser: Noronha, Thiago F., Ribeiro, Celso C., Santos, Andréa C.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford, UK Blackwell Publishing Ltd 01.09.2010
Wiley
Schlagworte:
bounded-diameter
Computer Science
constraint programming
diameter constrained spanning trees
Integer programming
Mathematical programming
Operations Research
Spanning trees
Studies
diameter constrained spanning trees
bounded-diameter
Spanning trees
constraint programming
ISSN:0969-6016, 1475-3995
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The diameter‐constrained minimum spanning tree problem consists in finding a minimum spanning tree of a given graph, subject to the constraint that the maximum number of edges between any two vertices in the tree is bounded from above by a given constant. This problem typically models network design applications where all vertices communicate with each other at a minimum cost, subject to a given quality requirement. We propose alternative formulations using constraint programming that circumvent weak lower bounds yielded by most mixed‐integer programming formulations. Computational results show that the proposed formulation, combined with an appropriate search procedure, solves larger instances and is faster than other approaches in the literature.
Bibliographie:istex:1BA810C3DA0B9928E5B9C6DB77F349BD4E4A6574
ArticleID:ITOR780
ark:/67375/WNG-ZXGW8RWN-V
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0969-6016
1475-3995
DOI:10.1111/j.1475-3995.2010.00780.x