Pages that link to "Item:Q2197445"
From MaRDI portal
The following pages link to A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445):
Displaying 4 items.
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees (Q2235240) (← links)
- A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
- The two-level diameter constrained spanning tree problem (Q2340278) (← links)