Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem

详细信息    查看全文

• 作者：Thiago F. Noronha ; André ; a C. Santos ; Celso C. Ribeiro
• 刊名：Electronic Notes in Discrete Mathematics
• 出版年：2008
• 出版时间：20 February 2008
• 年：2008
• 卷：30
• 期：Complete
• 页码：93-98
• 全文大小：214 K

文摘

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.