Pages that link to "Item:Q269488"
From MaRDI portal
The following pages link to Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488):
Displaying 8 items.
- Some new algorithms for location problems on networks (Q1291656) (← links)
- Closed 3-stop center and periphery in graphs (Q1757997) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems (Q3066160) (← links)
- The Round-Trip <i>p</i>-Center and Covering Problem on a Tree (Q3745587) (← links)
- Note on a Rectilinear Distance Round-Trip Location Problem (Q3755209) (← links)
- Efficient Algorithms for the Capacitated 1-Median Problem (Q4024313) (← links)
- Minimizing the expense transmission time from the source node to demand nodes (Q6497033) (← links)