Pages that link to "Item:Q620950"
From MaRDI portal
The following pages link to On the approximability of robust spanning tree problems (Q620950):
Displayed 4 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)
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
- Using the WOWA operator in robust discrete optimization problems (Q895514) (← links)