Solving diameter-constrained minimum spanning tree problems by constraint programming

DOI10.1111/J.1475-3995.2010.00780.XMaRDI QIDQ3002550zbMATH OpenOpenAlexFDO

Authors Thiago F. Noronha, Andréa Cynthia Santos, Celso C. 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)

Recommendations

• Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm
• Greedy heuristics for the diameter-constrained minimum spanning tree problem

Cites work

• Handbook of constraint programming.
• scientific article; zbMATH DE number 1629846 (Why is no real title available?)
• scientific article; zbMATH DE number 731844 (Why is no real title available?)
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integrated methods for optimization.
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees

Cited in

(21)

• A structured solution framework for fuzzy minimum spanning tree problem and its variants under different criteria
• Exact approaches for the minimum subgraph diameter problem
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
• The two-level diameter constrained spanning tree problem
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• The salesman and the tree: the importance of search in CP
• A new formulation for spanning trees
• Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
• Determining a Minimum Spanning Tree with Disjunctive Constraints
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• Solving the quorumcast routing problem by constraint programming
• The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm
• Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
• An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
• Algorithms for finding diameter-constrained graphs with maximum algebraic connectivity
• A constraint-based local search for edge disjoint rooted distance-constrained minimum spanning tree problem
• Exact algorithms for the product configuration problem
• On solving bi-objective constrained minimum spanning tree problems
• An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

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

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