Pages that link to "Item:Q3002550"
From MaRDI portal
The following pages link to Solving diameter-constrained minimum spanning tree problems by constraint programming (Q3002550):
Displaying 17 items.
- The salesman and the tree: the importance of search in CP (Q272000) (← links)
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
- Solving the quorumcast routing problem by constraint programming (Q487641) (← links)
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (Q863567) (← links)
- A structured solution framework for fuzzy minimum spanning tree problem and its variants under different criteria (Q2070755) (← links)
- Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
- A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- The two-level diameter constrained spanning tree problem (Q2340278) (← links)
- Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910) (← links)
- A new formulation for spanning trees (Q2840708) (← links)
- Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem (Q3503535) (← links)
- Determining a Minimum Spanning Tree with Disjunctive Constraints (Q3645334) (← links)
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees (Q4808431) (← links)
- An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677) (← links)
- Exact algorithms for the product configuration problem (Q6080625) (← links)
- On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
