Pages that link to "Item:Q976089"
From MaRDI portal
The following pages link to On the approximability of minmax (regret) network optimization problems (Q976089):
Displaying 6 items.
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← links)
- Using the WOWA operator in robust discrete optimization problems (Q895514) (← links)
- Approximability of the robust representatives selection problem (Q1785311) (← links)
- Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)