| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652667 | Electronic Notes in Discrete Mathematics | 2008 | 6 Pages |
Abstract
We propose a new formulation for the Diameter Constrained Minimum Spanning Tree Problem using constraint programming. Computational results have shown that this formulation combined with an appropriate search procedure solves larger instances and is faster than the other approaches in the literature.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
