Pages that link to "Item:Q2371518"
From MaRDI portal
The following pages link to Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518):
Displaying 6 items.
- Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems (Q733985) (← links)
- A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism (Q1659226) (← links)
- Solving 0-1 knapsack problems based on amoeboid organism algorithm (Q2016352) (← links)
- New upper bounds and exact methods for the knapsack sharing problem (Q2396494) (← links)
- Dynamic programming algorithm with objective level cut for nonlinear knapsack problem (Q2823517) (← links)
- An Efficient Algorithm for Non-Point Source Pollution Management Problems (Q4287625) (← links)