Pages that link to "Item:Q1894383"
From MaRDI portal
The following pages link to A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383):
Displaying 6 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- An exact algorithm for the reliability redundancy allocation problem (Q319293) (← links)
- An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (Q675985) (← links)
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
- Heuristic allocation based on a dynamic programming state-space representation (Q1602778) (← links)
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
