Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem

DOI10.1016/J.ENDM.2008.01.017MaRDI QIDQ3503535zbMATH OpenOpenAlexFDO

Authors Thiago F. Noronha, Andréa Cynthia Santos, Celso C. Ribeiro

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.01.017

zbMATH Keywords

diameter constrained minimum spanning tree problem

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27)

Recommendations

• Solving diameter-constrained minimum spanning tree problems by constraint programming
• A new formulation for spanning trees
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm
• A hybrid heuristic for the diameter constrained minimum spanning tree problem

Cites work

• scientific article; zbMATH DE number 731844 (Why is no real title available?)
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees

Cited in

(7)

• Exact approaches for the minimum subgraph diameter problem
• A polyhedral study of the diameter constrained minimum spanning tree problem
• The salesman and the tree: the importance of search in CP
• A new formulation for spanning trees
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

This page was built for publication: Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503535)