Pages that link to "Item:Q2218647"
From MaRDI portal
The following pages link to On the edge capacitated Steiner tree problem (Q2218647):
Displaying 7 items.
- Formulations for designing robust networks. An application to wind power collection (Q1742258) (← links)
- The \((K, k)\)-capacitated spanning tree problem (Q1926491) (← links)
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem (Q2253903) (← links)
- The capacity formulation of the capacitated edge activation problem (Q4584869) (← links)
- Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)
- Models of random subtrees of a graph (Q6183888) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)