Pages that link to "Item:Q5746684"
From MaRDI portal
The following pages link to On greedy approximation algorithms for a class of two-stage stochastic assignment problems (Q5746684):
Displaying 4 items.
- Task preference-based bottleneck assignment problem (Q2675766) (← links)
- (Q3713509) (← links)
- Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problems (Q5038169) (← links)
- From scenarios to conditional scenarios in two‐stage stochastic MILP problems (Q6070114) (← links)