The following pages link to Minmaxmin problems revisited (Q4405942):
Displaying 20 items.
- On solving some classes of multiple minimax problems (Q750317) (← links)
- On the solution of min-sum-min problems (Q813350) (← links)
- Robust network design in telecommunications under polytope demand uncertainty (Q976502) (← links)
- Conspiracy numbers for min-max search (Q1102218) (← links)
- Dynamic min-max problems (Q1300102) (← links)
- The solution of discrete minimax problems (Q1775209) (← links)
- The directions of decrease for minmaxmin problems (Q1842339) (← links)
- Continuous minimax optimization using modal intervals (Q2465802) (← links)
- The balance problem of min-max systems is co-nNP hard (Q2503672) (← links)
- (Q2932828) (← links)
- On Iterated Minimization in Nonconvex Optimization (Q3030596) (← links)
- (Q3337153) (← links)
- An approach to robust network design in telecommunications (Q3515394) (← links)
- An approach to classification based on separation of sets by means of several ellipsoids (Q3534645) (← links)
- An algorithm for minimax (Q3980568) (← links)
- (Q4706894) (← links)
- Mathematical diagnostics via nonsmooth analysis (Q5317745) (← links)
- Max–min separability (Q5317750) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)