Pages that link to "Item:Q2914306"

The following pages link to A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree (Q2914306):

Displaying 8 items.

• Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
• A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
• Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
• Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← 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)
• A minmax regret median problem on a tree under uncertain locations of the demand points (Q2450737) (← links)
• The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)