Pages that link to "Item:Q4427324"

The following pages link to Minmax Regret Median Location on a Network Under Uncertainty (Q4427324):

Displaying 29 items.

• Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
• Robust facility location problem for hazardous waste transportation (Q301070) (← links)
• A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← links)
• A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← links)
• An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541) (← 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)
• Emergency rescue location model with uncertain rescue time (Q1718453) (← links)
• Facility location problems with uncertainty on the plane (Q1779686) (← links)
• Complexity of robust single facility location problems on networks with uncertain edge lengths. (Q1811071) (← links)
• Capacitated multi-period maximal covering location problem with server uncertainty (Q2029288) (← 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)
• A distributionally robust optimization approach for two-stage facility location problems (Q2195563) (← links)
• On the minmax regret path median problem on trees (Q2353396) (← links)
• Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
• Robust location problems with pos/neg weights on a tree (Q2748385) (← links)
• Minimax regret path location on trees (Q3100694) (← links)
• Lexicographic<i>α</i>-robustness: an application to the 1-median problem (Q3561752) (← links)
• The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)
• Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780) (← links)
• Competitive facility location under attrition (Q6060546) (← links)
• Location Science in Canada (Q6102878) (← links)
• Robust maximum capture facility location under random utility maximization models (Q6113461) (← links)