Pages that link to "Item:Q935247"

The following pages link to A note on the minmax regret centdian location on trees (Q935247):

Displaying 12 items.

• Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
• Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
• Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
• An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
• Minimax regret 1-sink location problem in dynamic path networks (Q2348257) (← links)
• On the minmax regret path median problem on trees (Q2353396) (← links)
• Minimax regret path location on trees (Q3100694) (← links)
• Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780) (← links)