Pages that link to "Item:Q3503535"
From MaRDI portal
The following pages link to Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem (Q3503535):
Displaying 7 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)
- Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- A new formulation for spanning trees (Q2840708) (← links)
- Solving diameter-constrained minimum spanning tree problems by constraint programming (Q3002550) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)