Pages that link to "Item:Q4260015"

The following pages link to Minmax-regret robust 1-median location on a tree (Q4260015):

Displayed 28 items.

• Backup multifacility location problem with \(l_p\) norm (Q260687) ‎ (← links)
• Minmax regret 1-facility location on uncertain path networks (Q297369) ‎ (← 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)
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) ‎ (← links)
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) ‎ (← links)
• Minimax regret 1-median problem in dynamic path networks (Q726099) ‎ (← 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)
• Robust placement of sensors in dynamic water distribution systems (Q1040992) ‎ (← links)
• Algorithms for the robust 1-center problem on a tree (Q1569932) ‎ (← 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)
• 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)
• Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) ‎ (← links)
• Capacitated multi-period maximal covering location problem with server uncertainty (Q2029288) ‎ (← links)
• Robust absolute single machine makespan scheduling-location problem on trees (Q2294524) ‎ (← links)
• Minimax regret 1-sink location problem in dynamic path networks (Q2348257) ‎ (← links)
• On the minmax regret path median problem on trees (Q2353396) ‎ (← links)
• A minmax regret median problem on a tree under uncertain locations of the demand points (Q2450737) ‎ (← links)
• Robust location problems with pos/neg weights on a tree (Q2748385) ‎ (← links)
• Lexicographic<i>α</i>-robustness: an application to the 1-median problem (Q3561752) ‎ (← links)
• Ambulance Emergency Response Optimization in Developing Countries (Q5144767) ‎ (← 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)