Pages that link to "Item:Q2329707"
From MaRDI portal
The following pages link to Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707):
Displaying 6 items.
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem (Q2892146) (← links)
- Recoverable Robust Combinatorial Optimization Problems (Q5171791) (← links)
- Benchmarking problems for robust discrete optimization (Q6568403) (← links)
- Recoverable robust shortest path problem under interval budgeted uncertainty representations (Q6663971) (← links)