Pages that link to "Item:Q2103045"
From MaRDI portal
The following pages link to The polynomial robust knapsack problem (Q2103045):
Displaying 3 items.
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- A machine learning optimization approach for last-mile delivery and third-party logistics (Q6106567) (← links)
- Math‐based reinforcement learning for the adaptive budgeted influence maximization problem (Q6196896) (← links)