Pages that link to "Item:Q1751135"
From MaRDI portal
The following pages link to The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135):
Displaying 7 items.
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- A survey of decision making and optimization under uncertainty (Q2241216) (← links)
- A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
- On probabilistic algorithm for solving almost all instances of the set partition problem (Q2399381) (← links)
