Pages that link to "Item:Q2259050"
From MaRDI portal
The following pages link to A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050):
Displayed 4 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- On the recoverable robust traveling salesman problem (Q331985) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit (Q5223044) (← links)