Solving diameter-constrained minimum spanning tree problems by constraint programming

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 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.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02291646
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Thursday, September 19, 2019 - 9:56:04 AM
Last modification on : Thursday, October 3, 2019 - 1:27:37 AM

Links full text

Identifiers

Collections

Citation

Thiago Noronha, Celso Ribeiro, Andréa Cynthia Santos. Solving diameter-constrained minimum spanning tree problems by constraint programming. International Transactions in Operational Research, Wiley, 2010, 17 (5), pp.653-665. ⟨10.1111/j.1475-3995.2010.00780.x⟩. ⟨hal-02291646⟩

Share

Metrics

Record views

27