Pages that link to "Item:Q4909575"

The following pages link to Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights (Q4909575):

Displaying 3 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)
• The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)