Solving diameter-constrained minimum spanning tree problems by constraint programming

DOI10.1111/j.1475-3995.2010.00780.xzbMath1220.90152OpenAlexW2059559155MaRDI QIDQ3002550

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

Publication date: 20 May 2011

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2010.00780.x

zbMATH Keywords

bounded-diameter

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (7)

Exact algorithms for the product configuration problem ⋮ On solving bi-objective constrained minimum spanning tree problems ⋮ Modeling and solving the bi-objective minimum diameter-cost spanning tree problem ⋮ Solving the quorumcast routing problem by constraint programming ⋮ A structured solution framework for fuzzy minimum spanning tree problem and its variants under different criteria ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem ⋮ The two-level diameter constrained spanning tree problem

Cites Work

• Integrated methods for optimization.
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving diameter-constrained minimum spanning tree problems by constraint programming