Pages that link to "Item:Q4798193"
From MaRDI portal
The following pages link to Efficient algorithms for finding the (k,l)-core of tree networks (Q4798193):
Displaying 4 items.
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges (Q2294142) (← links)
