Pages that link to "Item:Q765526"
From MaRDI portal
The following pages link to A note on robustness tolerances for combinatorial optimization problems (Q765526):
Displaying 11 items.
- Complexity and in-approximability of a selection problem in robust optimization (Q385465) (← links)
- Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
- Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria (Q1650398) (← links)
- Extending single tolerances to set tolerances (Q1671336) (← links)
- Global tolerances in the problems of combinatorial optimization with an additive objective function (Q1930843) (← links)
- Size versus truncation robustness in the assignment problem (Q1985723) (← links)
- On accuracy, robustness and tolerances in vector Boolean optimization (Q2253450) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- From Optimality Robustness To Sufficiency and Completeness (Q4792098) (← links)
- Recoverable Robust Combinatorial Optimization Problems (Q5171791) (← links)
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty (Q6168886) (← links)