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

Full description

Bibliographic Details

Published in:	International transactions in operational research Vol. 17; no. 5; pp. 653 - 665
Main Authors:	Noronha, Thiago F., Ribeiro, Celso C., Santos, Andréa C.
Format:	Journal Article
Language:	English
Published:	Oxford, UK Blackwell Publishing Ltd 01.09.2010 Wiley
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!