Pages that link to "Item:Q2450748"
From MaRDI portal
The following pages link to Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion (Q2450748):
Displaying 5 items.
- Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making (Q2097653) (← links)
- Ordered weighted average combinatorial optimization: formulations and their properties (Q2449062) (← links)
- Sensitivity analysis for bottleneck assignment problems (Q2673565) (← links)
