Pages that link to "Item:Q777269"
From MaRDI portal
The following pages link to On the minmax regret path center problem on trees (Q777269):
Displaying 7 items.
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
- A note on the minmax regret centdian location on trees (Q935247) (← links)
- Algorithms for the robust 1-center problem on a tree (Q1569932) (← links)
- An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
- On the minmax regret path median problem on trees (Q2353396) (← links)
- Minimax regret path location on trees (Q3100694) (← links)