Pages that link to "Item:Q1681259"
From MaRDI portal
The following pages link to On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259):
Displayed 17 items.
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Robust multicovers with budgeted uncertainty (Q1755380) (← links)
- A linear time algorithm for the robust recoverable selection problem (Q1983118) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
- Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
- Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
- Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134) (← links)
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- An alternative efficient representation for the project portfolio selection problem (Q2329483) (← links)
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772) (← links)
- Multistage robust discrete optimization via quantified integer programming (Q2669532) (← links)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218) (← links)
- On the complexity of robust multi-stage problems with discrete recourse (Q6180695) (← links)
