Pages that link to "Item:Q1936659"
From MaRDI portal
The following pages link to Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659):
Displaying 14 items.
- Complexity and in-approximability of a selection problem in robust optimization (Q385465) (← links)
- Robust approach to restricted items selection problem (Q828685) (← links)
- Approximability of the robust representatives selection problem (Q1785311) (← links)
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion (Q1881565) (← links)
- Approximating the min-max (regret) selecting items problem (Q1941689) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
- Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
- Optimal control algorithms and their analysis for short-term scheduling in manufacturing systems (Q2283836) (← links)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints (Q6202946) (← links)
- Benchmarking problems for robust discrete optimization (Q6568403) (← links)
- Approximating the shortest path problem with scenarios (Q6652474) (← links)
