Solving diameter‐constrained minimum spanning tree problems by constraint programming
Published in International Transactions in Operational Research • Aug 17, 2010
Authors:,,
Thiago F. Noronha
Celso C. Ribeiro
Andréa Cynthia Santos
Abstract
Abstract 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 netwo...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!