The following pages link to (Q4260015):
Displayed 14 items.
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) (← 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)
- 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)
- 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)
- 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)