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...

Celý popis

Podrobná bibliografie

Vydáno v:	International transactions in operational research Ročník 17; číslo 5; s. 653 - 665
Hlavní autoři:	Noronha, Thiago F., Ribeiro, Celso C., Santos, Andréa C.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford, UK Blackwell Publishing Ltd 01.09.2010 Wiley
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!