Pages that link to "Item:Q2424772"
From MaRDI portal
The following pages link to Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Q2424772):
Displaying 4 items.
- Strong formulations of robust mixed 0-1 programming (Q2502200) (← links)
- Recoverable Robust Combinatorial Optimization Problems (Q5171791) (← links)
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- Recoverable robust shortest path problem under interval budgeted uncertainty representations (Q6663971) (← links)