Solving diameter-constrained minimum spanning tree problems by constraint programming - Archive ouverte HAL Access content directly
Journal Articles International Transactions in Operational Research Year : 2010

Solving diameter-constrained minimum spanning tree problems by constraint programming

(1) , (2) , (3)
1
2
3

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.

Dates and versions

hal-02291646 , version 1 (19-09-2019)

Identifiers

Cite

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

Collections

CNRS UTT LOSI
19 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More